Solving NP-hard semirandom graph problems in polynomial expected time

Authors:
Amin Coja-Oghlan
Affiliations:
Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099 Berlin, Germany
Venue:
Journal of Algorithms
Year:
2007

Citing 12
Cited 3

The solution of some random NP-hard problems in polynomial expected time

Journal of Algorithms
Coloring random and semi-random k-colorable graphs

Journal of Algorithms
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Algorithmic theory of random graphs

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Approximate graph coloring by semidefinite programming

Journal of the ACM (JACM)
Approximating the independence number via the j -function

Mathematical Programming: Series A and B
Zero knowledge and the chromatic number

Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Minimum coloring k-colorable graphs in polynomial average time

Journal of Algorithms
Finding and certifying a large hidden clique in a semirandom graph

Random Structures & Algorithms
Derandomizing Approximation Algorithms Based on Semidefinite Programming

SIAM Journal on Computing
Relations between average case complexity and approximation complexity

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Heuristics for semirandom graph problems

Journal of Computer and System Sciences

Finding Large Independent Sets in Polynomial Expected Time

Combinatorics, Probability and Computing
A generalization of Nemhauser and Trotter's local optimization theorem

Journal of Computer and System Sciences
Smoothed complexity theory

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this paper is to present an SDP-based algorithm for finding a sparse induced subgraph of order @Q(n) hidden in a semirandom graph of order n. As an application we obtain an algorithm that requires not more than O(n) random edges in order to k-color a semirandom k-colorable graph within polynomial expected time, thereby extending results of Feige and Kilian [J. Comput. System Sci. 63 (2001) 639-671] and of Subramanian [J. Algorithms 33 (1999) 112-123].