Sciweavers

7 search results - page 2 / 2
» Projection, Lifting and Extended Formulation in Integer and ...
Sort
View
MP
2006
142views more  MP 2006»
13 years 4 months ago
Exploring the Relationship Between Max-Cut and Stable Set Relaxations
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
Monia Giandomenico, Adam N. Letchford
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
14 years 5 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri