7129 search results - page 29 / 1426 » Approximation Algorithms for Treewidth |
CORR
2011
Springer
14 years 4 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
ESA
2005
Springer
15 years 3 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...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
STOC
2001
ACM
15 years 10 months ago
2001
ACM
121
click to vote
SIGECOM
2011
ACM
14 years 15 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...