3874 search results - page 4 / 775 » Approximation Algorithms for k-hurdle Problems |
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-...
APPROX
2000
Springer
15 years 1 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
IPL
2011
14 years 4 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
ORL
1998
14 years 9 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...