783 search results - page 4 / 157 » Improved approximation algorithms for the freeze-tag problem |
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
ICALP
2011
Springer
13 years 1 days ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract—Hybrid methods are very popular for solving problems from combinatorial optimization. In contrast to this the theoretical understanding of the interplay of different opt...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...