7006 search results - page 137 / 1402 » Approximation Algorithms |
130
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
142
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
127
Voted
SIGCOMM
2006
ACM
15 years 8 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
119
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
111
click to vote
COMGEO
2010
ACM
15 years 2 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...