Article

O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems

Authors:

Moses Charikar,

Konstantin Makarychev,

Yury MakarychevAuthors Info & Claims

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Pages 573 - 581

https://doi.org/10.1145/1060590.1060675

Published: 22 May 2005 Publication History

Abstract

We give O(√log n)-approximation algorithms for the MIN UNCUT, MIN 2CNF DELETION, DIRECTED BALANCED SEPERATOR, and DIRECTED SPARSEST CUT problems. The previously best known algorithms give an O(log n)-approximation for MIN UNCUT [9], DIRECTED BALANCED SEPERATOR [17], DIRECTED SPARSEST CUT [17], and an O(log n log log n)-approximation for MIN 2CNF DELETION [14].We also show that the integrality gap of an SDP relaxation of the MINIMUM MULTICUT problem is Ω(log n).

References

[1]

S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci., 54(2):317--331, 1997.

Digital Library

[2]

S. Arora, J. R. Lee, and A. Naor. Euclidean distortion and the sparsest cut. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005.

Digital Library

[3]

S. Arora, S. Rao, and U. Vazirani. Expander flows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 222--231, 2004.

Digital Library

[4]

B. Bollobás. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Probabilistic Combinatorics, pages 122--130. 1986.

[5]

M. Charikar, H. Karloff, and S. Rao. Improved approximation algorithms for vertex ordering problems. In manuscript, 2004.

[6]

S. Chawla, A. Gupta, and H. Räcke. Approximations for generalized sparsest cut and embeddings of l2 into l1. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.

Digital Library

[7]

M. Chlebík and J. Chlebíková. On approximation hardness of the minimum 2sat-deletion problem. In Proceedings of 29th International Symposium on Mathematical Foundations of Computer Science, pages 263--273, 2004.

[8]

P. Frankl and V. Rödl. Forbidden intersections. Trans. Amer. Math. Soc., 300:259--286, 1987.

[9]

N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC), pages 698--707, 1993.

Digital Library

[10]

S. Hart. A note on the edges of the n-cube. Discrete Mathematics, 14:157--163, 1976.

Digital Library

[11]

G. Karakostas. A better approximation ratio for the vertex cover problem. In Electronic Colloquium on Computational Complexity Report TR04-084, 2004.

[12]

S. Khanna, M. Sudan, L. Trevisan, and D. P. Williamson. The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863--1920, 2001.

Digital Library

[13]

S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pages 767--775, 2002.

Digital Library

[14]

P. Klein, S. Plotkin, S. Rao, and E. Tardos. Approximation algorithms for steiner and directed multicuts. Journal of Algorithms, 22:241--269, 1997.

Digital Library

[15]

D. G. Larman and C. A. Rogers. Realization of distances within sets in euclidean space. Mathematika, 19:1--24, 1972.

[16]

J. R. Lee. On distance scales, embeddings, and efficient relaxations of the cut cone. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005.

Digital Library

[17]

T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM, 46(6):787--832, 1999.

Digital Library

[18]

C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Computer and System Sciences, 43:425--440, 1991.

[19]

B. Yu, J. Cheriyan, and P. E. Haxell. Hypercubes and multicommodity flows. SIAM Journal on Discrete Mathematics, 10(2):190--200, 1997.

Digital Library

Cited By

Cohen-Addad Vd'Orsi TMousavifar ASalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)A near-linear time approximation algorithm for beyond-worst-case graph clusteringProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692437(9208-9229)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692437
Bandyapadhyay SLochet WLokshtanov DSaurabh SXue J(2024)True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk GraphsACM Transactions on Algorithms10.1145/365604220:3(1-26)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3656042
Chen JMang QZhou HPeng RGao YMa CBaeza-Yates RBonchi F(2024)Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed NetworksProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671674(278-287)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671674
Show More Cited By

Index Terms

O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Improved approximation for directed cut problems
STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

We present improved approximation algorithms for directed multicutand directed sparsest cut. The current best known approximationratio for these problems is O(n^1/2). We obtain an Õ(n^11/23)-approximation. Our algorithm works with thenatural LP relaxation ...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems

In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
COCOA 2015: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486

A d-clique in a graph $$G = V, E$$G=V,E is a subset $$S\subseteq V$$S⊆V of vertices such that for pairs of vertices $$u, v\in S$$u,v∈S, the distance between u and v is at most d in G. A d-club in a graph $$G = V, E$$G=V,E is a subset $$S'\subseteq V$$S'⊆...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

May 2005

778 pages

ISBN:1581139608

DOI:10.1145/1060590

General Chair:
Hal Gabow
University of Colorado
,
Program Chair:
Ronald Fagin
IBM Almaden Research Center

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 May 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

STOC05

Sponsor:

STOC05: Symposium on Theory of Computing

May 22 - 24, 2005

MD, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

121
Total Citations
View Citations
1,046
Total Downloads

Downloads (Last 12 months)59
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cohen-Addad Vd'Orsi TMousavifar ASalakhutdinov RKolter ZHeller KWeller AOliver NScarlett JBerkenkamp F(2024)A near-linear time approximation algorithm for beyond-worst-case graph clusteringProceedings of the 41st International Conference on Machine Learning10.5555/3692070.3692437(9208-9229)Online publication date: 21-Jul-2024
https://dl.acm.org/doi/10.5555/3692070.3692437
Bandyapadhyay SLochet WLokshtanov DSaurabh SXue J(2024)True Contraction Decomposition and Almost ETH-Tight Bipartization for Unit-Disk GraphsACM Transactions on Algorithms10.1145/365604220:3(1-26)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1145/3656042
Chen JMang QZhou HPeng RGao YMa CBaeza-Yates RBonchi F(2024)Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed NetworksProceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining10.1145/3637528.3671674(278-287)Online publication date: 25-Aug-2024
https://dl.acm.org/doi/10.1145/3637528.3671674
Bansal NKatzelnick DSchwartz R(2024)On Approximating Cutwidth and Pathwidth2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00051(713-729)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00051
Dondi RPopa A(2024)Exact and approximation algorithms for covering timeline in temporal graphsAnnals of Operations Research10.1007/s10479-024-05993-8Online publication date: 26-Apr-2024
https://doi.org/10.1007/s10479-024-05993-8
Lau LTung KWang RSaha BServedio R(2023)Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted EigenvaluesProceedings of the 55th Annual ACM Symposium on Theory of Computing10.1145/3564246.3585139(1834-1847)Online publication date: 2-Jun-2023
https://dl.acm.org/doi/10.1145/3564246.3585139
Zhao XYan BZhang P(2023)New algorithms for a simple measure of network partitioningTheoretical Computer Science10.1016/j.tcs.2023.113846957(113846)Online publication date: May-2023
https://doi.org/10.1016/j.tcs.2023.113846
Dondi RPopa A(2023)Timeline Cover in Temporal Graphs: Exact and Approximation AlgorithmsCombinatorial Algorithms10.1007/978-3-031-34347-6_15(173-184)Online publication date: 3-Jun-2023
https://doi.org/10.1007/978-3-031-34347-6_15
Zhao XYan BZhang P(2023)New Algorithms for a Simple Measure of Network PartitioningTheory and Applications of Models of Computation10.1007/978-3-031-20350-3_7(67-78)Online publication date: 1-Jan-2023
https://doi.org/10.1007/978-3-031-20350-3_7
Banerjee AReeser MDing G(2022)Distributed Matrix Tiling Using A Hypergraph Labeling FormulationProceedings of the 23rd International Conference on Distributed Computing and Networking10.1145/3491003.3491017(62-71)Online publication date: 4-Jan-2022
https://dl.acm.org/doi/10.1145/3491003.3491017
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten