6 search results - page 1 / 2 » Sampling subproblems of heterogeneous Max-Cut problems and a... |
50
Voted
RSA
2008
14 years 10 months ago
2008
STACS
2005
Springer
15 years 4 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
102
Voted
APPROX
2009
Springer
15 years 5 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
105
Voted
ESA
2008
Springer
15 years 19 days ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
112
Voted
STOC
2009
ACM
15 years 11 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...