3875 search results - page 104 / 775 » Approximation algorithms for the 0-extension problem |
155
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
123
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
125
click to vote
ALGORITHMICA
2005
15 years 4 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
131
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
158
click to vote
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...