Multiway cut, pairwise realizable distributions, and descending thresholds
From MaRDI portal
(Redirected from Publication:5259608)
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.
Recommendations
Cites work
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(27)- Improved approximation algorithms for the maximum happy vertices and edges problems
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
- Solving \((k-1)\)-stable instances of \texttt{k-terminal cut} with isolating cuts
- On the (near) optimality of extended formulations for multi-way cut in social networks
- _p-norm multiway cut
- Geometric multicut: shortest fences for separating groups of objects in the plane
- A simple algorithm for the multiway cut problem
- Beating the 2-approximation factor for global bicut
- Approximation algorithms for vertex happiness
- From graph to hypergraph multiway partition: is the single threshold the only route?
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Simplex partitioning via exponential clocks and the multiway-cut problem
- Approximation Algorithms for CSPs
- Simplex transformations and the multiway cut problem
- Global and fixed-terminal cuts in digraphs
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Improving the integrality gap for multiway cut
- Fixed parameter approximation scheme for min-max \(k\)-cut
- Vertex downgrading to minimize connectivity
- Approximating Requirement Cut via a Configuration LP
- A local search approximation algorithm for the multiway cut problem
- Monotone submodular multiway partition
- Multiway cuts with a choice of representatives
- An FPT constant-factor approximation algorithm for correlation clustering
- Approximating submodular matroid-constrained partitioning
- Multiway cuts with a choice of representatives
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
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)
