2137 search results - page 12 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
IJCAI
2001
13 years 10 months ago
2001
We study the impact of backbones in optimization and approximation problems. We show that some optimization problems like graph coloring resemble decision problems, with problem h...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
SIAMCOMP
1998
13 years 8 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
DISOPT
2010
13 years 8 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...