Derandomizing Approximation Algorithms Based on Semidefinite Programming

Authors:
Sanjeev Mahajan;H. Ramesh
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
1999

Citing 0
Cited 29

Coloring k-colorable graphs using smaller palettes

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Convex quadratic and semidefinite programming relaxations in scheduling

Journal of the ACM (JACM)
Algorithmic derandomization via complexity theory

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Coloring k-colorable graphs using relatively small palettes

Journal of Algorithms
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection

Journal of Global Optimization
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximating MIN k-SAT

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Improved Approximation Algorithms for MAX \frac{n}2-DIRECTED-BISECTION and MAX \frac{n}2-DENSE-SUBGRAPH

Journal of Global Optimization
General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures

Combinatorics, Probability and Computing
Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming

Journal of Computer and System Sciences - STOC 2001
Approximating the cut-norm via Grothendieck's inequality

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Alluvion and cascade: fast data dissemination schemes in multihop wireless networks

MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
Solving NP-hard semirandom graph problems in polynomial expected time

Journal of Algorithms
Canonical subsets of image features

Computer Vision and Image Understanding
SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An invariance principle for polytopes

Proceedings of the forty-second ACM symposium on Theory of computing
Approximation of canonical sets and their applications to 2D view simplification

CVPR'04 Proceedings of the 2004 IEEE computer society conference on Computer vision and pattern recognition
Derandomizing HSSW algorithm for 3-SAT

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Deterministic discrepancy minimization

ESA'11 Proceedings of the 19th European conference on Algorithms
Approximating Max kCSP - outperforming a random assignment with almost a linear factor

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Stable bounded canonical sets and image matching

EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Improved approximation algorithms for maximum graph partitioning problems extended abstract

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The capacitated max-k-cut problem

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Explicit Dimension Reduction and Its Applications

SIAM Journal on Computing
An invariance principle for polytopes

Journal of the ACM (JACM)
SDP-based algorithms for maximum independent set problems on hypergraphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Remarkable breakthroughs have been made recently in obtaining approximate solutions to some fundamental NP-hard problems, namely Max-Cut, Max k-Cut, Max-Sat, Max-Dicut, Max-bisection, k-vertex coloring, maximum independent set, etc. All these breakthroughs involve polynomial time randomized algorithms based upon semidefinite programming, a technique pioneered by Goemans and Williamson. In this paper, we give techniques to derandomize the above class of randomized algorithms, thus obtaining polynomial time deterministic algorithms with the same approximation ratios for the above problems. At the heart of our technique is the use of spherical symmetry to convert a nested sequence of n integrations, which cannot be approximated sufficiently well in polynomial time, to a nested sequence of just a constant number of integrations, which can be approximated sufficiently well in polynomial time.