Mar 12, 2015 · We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut.

We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut.

We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node- weighted Multiway Cut, and Hypergraph Multiway Cut ...

Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems · Alina Ene, J. Vondrák, Yi Wu · Published in ACM-SIAM Symposium on… 6 ...

Dec 18, 2013 · Finally, we connect the two hardness techniques by proving that the integrality gap of the Local Distribution LP coincides with the symmetry gap ...

We study the approximability of multiway partitioning problems, examples of which include Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut.

Aug 13, 2018 · Bibliographic details on Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems.

We study the approximability of multiway partitioning problems, examples of which inlude Multiway Cut, Node-weighted Multiway Cut, and Hypergraph Multiway Cut.

Symmetry gap is the gap between “symmetric" and “asymmetric" solutions, in the “multilinear relaxation". It implies hardness for submodular optimization: in ...

Alina Ene, Jan Vondrák, Yi Wu: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems. SODA 2013: 306-325.