Multiway cut, pairwise realizable distributions, and descending thresholds
From MaRDI portal
Publication:5259608
DOI10.1145/2591796.2591866zbMATH Open1315.68288arXiv1309.2729OpenAlexW2060121592MaRDI QIDQ5259608FDOQ5259608
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Abstract: We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds. Then, we prove that this factor can be improved by introducing a new rounding scheme: (3) single-coordinate cuts with descending thresholds. By combining these three schemes, we design an algorithm that achieves a factor of (10 + 4 sqrt(3))/13 (approximately 1.30217). This is the best approximation factor that we are able to verify by hand. Finally, we show that by combining these three rounding schemes with the scheme of independent thresholds from Karger et al., 2004, the approximation factor can be further improved to 1.2965. This approximation factor has been verified only by computer.
Full work available at URL: https://arxiv.org/abs/1309.2729
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)
Cites Work
- Theory of Cryptography
- The geometry of differential privacy: the small database and approximate cases
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower Bounds in Differential Privacy
- Iterative Constructions and Private Data Release
- Differential Privacy and the Fat-Shattering Dimension of Linear Queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the Sample Complexity for Private Learning and Private Data Release
- Answering n {2+o(1)} counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster Algorithms for Privately Releasing Marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately releasing conjunctions and the statistical query barrier
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (21)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
- A local search approximation algorithm for the multiway cut problem
- A simple algorithm for the multiway cut problem
- Vertex downgrading to minimize connectivity
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- Simplex Transformations and the Multiway Cut Problem
- On the (near) optimality of extended formulations for multi-way cut in social networks
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Improving the integrality gap for multiway cut
- Global and fixed-terminal cuts in digraphs
- Approximation Algorithms for CSPs
- Approximation algorithms for vertex happiness
- \(\ell_p\)-norm multiway cut
- Approximating Requirement Cut via a Configuration LP
- Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Beating the 2-approximation factor for global bicut
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts
- Geometric multicut: shortest fences for separating groups of objects in the plane
Uses Software
Recommendations
- Title not available (Why is that?) 👍 👎
- Rounding algorithms for a geometric embedding of minimum multiway cut 👍 👎
- An improved approximation algorithm of MULTIWAY CUT. 👍 👎
- Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut 👍 👎
- Rounding algorithms for a geometric embedding of minimum multiway cut 👍 👎
This page was built for publication: Multiway cut, pairwise realizable distributions, and descending thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259608)
