3874 search results - page 169 / 775 » Approximation Algorithms for k-hurdle Problems |
112
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
123
Voted
SODA
2007
ACM
15 years 3 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
126
click to vote
COMPGEOM
2000
ACM
15 years 6 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
121
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
113
click to vote
WEA
2005
Springer
15 years 7 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...