3875 search results - page 2 / 775 » Approximation Algorithms for the Max-coloring Problem |
IPCO
2004
13 years 6 months ago
2004
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
ISAAC
1995
Springer
13 years 8 months ago
1995
Springer
ESA
2008
Springer
13 years 7 months ago
2008
Springer
SODA
1997
ACM
13 years 6 months ago
1997
ACM
