On the (near) optimality of extended formulations for multi-way cut in social networks
From MaRDI portal
Publication:2129209
Recommendations
Cites work
- scientific article; zbMATH DE number 5485510 (Why is no real title available?)
- scientific article; zbMATH DE number 176254 (Why is no real title available?)
- scientific article; zbMATH DE number 1342124 (Why is no real title available?)
- A Theory of Fairness, Competition, and Cooperation
- A lower bound of \(8/(7+\frac{1}{k-1})\) on the integrality ratio of the Călinescu-Karloff-Rabani relaxation for multiway cut
- An improved approximation algorithm of MULTIWAY CUT.
- Analysis of LP relaxations for multiway and multicut problems
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Euclidean Hub-and-Spoke Networks
- Extended formulations for the \(A\)-cut problem
- Finding k Cuts within Twice the Optimal
- Multi-Terminal Network Flows
- Multiway cut, pairwise realizable distributions, and descending thresholds
- On the multiway cut polyhedron
- Planar orientations with low out-degree and compaction of adjacency matrices
- Simplex partitioning via exponential clocks and the multiway cut problem
- The Complexity of Multiterminal Cuts
This page was built for publication: On the (near) optimality of extended formulations for multi-way cut in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129209)