667 search results - page 33 / 134 » Approximation algorithms for connected facility location pro... |
129
click to vote
FOCS
2007
IEEE
15 years 9 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
147
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We consider the variant of the minimum vertex cover problem in which we require that the cover induces a connected subgraph. We give new approximation results for this problem in d...
151
click to vote
STOC
2009
ACM
16 years 3 months ago
2009
ACM
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
129
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
115
click to vote
CCCG
2008
15 years 4 months ago
2008
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...