Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

RSA
2008

67views more RSA 2008»

Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms

15 years 1 months ago

Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms

Download cs-www.cs.yale.edu

Petros Drineas, Ravi Kannan, Michael W. Mahoney

Real-time Traffic

RSA 2008 |

claim paper

Related Content

» Sampling Subproblems of Heterogeneous Maxcut Problems and Approximation Algorithms

» Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

» Deterministic Sampling Algorithms for Network Design

» Nonmonotone submodular maximization under matroid and knapsack constraints

» A General Framework for Structured Sparsity via Proximal Optimization

Post Info
More Details (n/a)

Added	28 Dec 2010
Updated	28 Dec 2010
Type	Journal
Year	2008
Where	RSA
Authors	Petros Drineas, Ravi Kannan, Michael W. Mahoney

Comments (0)