Sciweavers

4 search results - page 1 / 1
» Sampling Sub-problems of Heterogeneous Max-cut Problems and ...
Sort
View
RSA
2008
67views more  RSA 2008»
13 years 4 months ago
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Petros Drineas, Ravi Kannan, Michael W. Mahoney
STACS
2005
Springer
13 years 10 months ago
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
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 ...
Petros Drineas, Ravi Kannan, Michael W. Mahoney
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
13 years 11 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
STOC
2009
ACM
163views Algorithms» more  STOC 2009»
14 years 5 months ago
Non-monotone submodular maximization under matroid and knapsack constraints
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hy...
Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, M...