3875 search results - page 24 / 775 » Approximation Algorithms for the Max-coloring Problem |
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
We give subexponential time approximation algorithms for UNIQUE GAMES and the SMALL-SET EXPANSION. Specifically, for some absolute constant c, we give:
ALGORITHMICA
2004
13 years 7 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Optimization problems with a nuclear norm regularization, such as e.g. low norm matrix factorizations, have seen many applications recently. We propose a new approximation algorit...
IPL
2008
13 years 7 months ago
2008
A problem open for many years is whether there is an FPT algorithm that given a graph G and parameter k, either: (1) determines that G has no k-Dominating Set, or (2) produces a do...