4843 search results - page 146 / 969 » The Shortcut Problem - Complexity and Approximation |
286
click to vote
AAIM
2011
Springer
14 years 6 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 ...
99
Voted
STOC
2002
ACM
16 years 3 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...
122
click to vote
WEA
2005
Springer
15 years 8 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...
154
click to vote
SCIA
2009
Springer
15 years 9 months 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...
151
click to vote
SODA
2012
ACM
13 years 5 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...