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

Authors:
Amit Agarwal;Moses Charikar;Konstantin Makarychev;Yury Makarychev
Affiliations:
Princeton University, Princeton, NJ;Princeton University, Princeton, NJ;Princeton University, Princeton, NJ;Princeton University, Princeton, NJ
Venue:
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Year:
2005

Citing 11
Cited 52

Approximate max-flow min-(multi)cut theorems and their applications

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Hypercubes and Multicommodity Flows

SIAM Journal on Discrete Mathematics
Approximation algorithms for Steiner and directed multicuts

Journal of Algorithms
The hardness of approximate optima in lattices, codes, and systems of linear equations

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
The Approximability of Constraint Satisfaction Problems

SIAM Journal on Computing
Expander flows, geometric embeddings and graph partitioning

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Euclidean distortion and the sparsest cut

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On distance scales, embeddings, and efficient relaxations of the cut cone

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms

Multicommodity flow, well-linked terminals, and routing problems

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into \ell 1

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Fast Algorithms for Approximate Semide.nite Programming using the Multiplicative Weights Update Method

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Directed metrics and directed graph partitioning problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximating unique games

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
l22 spreading metrics for vertex ordering problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Trees and Markov convexity

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Correlation clustering with a fixed number of clusters

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Near-optimal algorithms for unique games

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An O(√n)-approximation algorithm for directed sparsest cut

Information Processing Letters
The NP-completeness column: The many limits on approximation

ACM Transactions on Algorithms (TALG)
Inoculation strategies for victims of viruses and the sum-of-squares partition problem

Journal of Computer and System Sciences
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover

Discrete Applied Mathematics
The multi-multiway cut problem

Theoretical Computer Science
Complexity and approximation of the minimum recombinant haplotype configuration problem

Theoretical Computer Science
A combinatorial, primal-dual approach to semidefinite programs

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Vertex cuts, random walks, and dimension reduction in series-parallel graphs

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

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A divide and conquer algorithm for d-dimensional arrangement

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Spectral clustering with inconsistent advice

Proceedings of the 25th international conference on Machine learning
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1Embeddability of Negative Type Metrics

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Coarse Differentiation and Multi-flows in Planar Graphs

APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improved equilibria via public service advertising

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Partitioning graphs into balanced components

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved approximation bound for quadratic optimization problems with orthogonality constraints

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expander flows, geometric embeddings and graph partitioning

Journal of the ACM (JACM)
Max cut and the smallest eigenvalue

Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems

ACM Transactions on Algorithms (TALG)
A better approximation ratio for the vertex cover problem

ACM Transactions on Algorithms (TALG)
Heat-ray: combating identity snowball attacks using machinelearning, combinatorial optimization and attack graphs

Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
An O(n)-approximation algorithm for directed sparsest cut

Information Processing Letters
Approximation algorithms for the Bipartite Multicut problem

Information Processing Letters
The complexity of finding subgraphs whose matching number equals the vertex cover number

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Balanced bipartite graph based register allocation for network processors in mobile and wireless networks

Mobile Information Systems - Mobile and Wireless Networks
Bilipschitz snowflakes and metrics of negative type

Proceedings of the forty-second ACM symposium on Theory of computing
On approximation of new optimization methods for assessing network vulnerability

INFOCOM'10 Proceedings of the 29th conference on Information communications
Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization
Distributing data for secure database services

Proceedings of the 4th International Workshop on Privacy and Anonymity in the Information Society
Near-optimal distortion bounds for embedding doubling spaces into L1

Proceedings of the forty-third annual ACM symposium on Theory of computing
Tight bounds on local search to approximate the maximum satisfiability problems

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A better approximation ratio for the vertex cover problem

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Complexity and approximation of the minimum recombination haplotype configuration problem

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Distributing Data for Secure Database Services

Transactions on Data Privacy
Approximation algorithms for semi-random partitioning problems

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On polynomial kernels for structural parameterizations of odd cycle transversal

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximation of the Quadratic Set Covering problem

Discrete Optimization
On new approaches of assessing network vulnerability: hardness and approximation

IEEE/ACM Transactions on Networking (TON)
Sorting noisy data with partial information

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Complexity of approximating CSP with balance / hard constraints

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

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).