4894 search results - page 153 / 979 » The Guarding Problem - Complexity and Approximation |
172
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
The method of enhanced assumed strains (EAS) is a popular tool for avoiding locking phenomena, e.g., a remedy for shear locking in plane elasticity. We consider bending-dominated p...
363
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
133
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
167
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...
203
click to vote
SCIA
2009
Springer
16 years 29 days ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...