3875 search results - page 115 / 775 » Approximation Algorithms for the Max-coloring Problem |
151
Voted
ESA
1999
Springer
15 years 6 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
124
click to vote
COCO
2007
Springer
15 years 6 months ago
2007
Springer
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
103
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
We give a simple algorithm for the MINIMUM DIRECTED MULTICUT problem, and show that it gives an Ç´ÔÒµapproximation. This improves on the previous approximation guarantee of ...
139
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
110
Voted
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...