Solving NP-hard semirandom graph problems in polynomial expected time

doi:10.1016/j.jalgor.2004.07.003

Journal of Algorithms

Volume 62, Issue 1, January 2007, Pages 19-46

https://doi.org/10.1016/j.jalgor.2004.07.003 Get rights and content

Abstract

The aim of this paper is to present an SDP-based algorithm for finding a sparse induced subgraph of order $Θ (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].

References (20)

M. Dyer et al.
The solution of some NP-hard problems in polynomial expected time
J. Algorithms
(1989)
U. Feige et al.
Zero knowledge and the chromatic number
J. Comput. System Sci.
(1998)
U. Feige et al.
Heuristics for semirandom graph problems
J. Comput. System Sci.
(2001)
E.L. Lawler
A note on the complexity of the chromatic number problem
Inform. Process. Lett.
(1976)
C. Subramanian
Minimum coloring random and semirandom graphs in polynomial average time
J. Algorithms
(1999)
N. Alon et al.
Approximating the independence number via the ϑ-function
Math. Programming
(1998)
A. Blum et al.
Coloring random and semirandom k-colorable graphs
J. Algorithms
(1995)
U. Feige
Relations between average case complexity and approximation complexity
U. Feige et al.
Finding and certifying a large hidden clique in a semirandom graph
Random Structures Algorithms
(2000)
U. Feige, J. Krauthgamer, Improved performance guarantees for bandwidth minimization heuristics, Manuscript,...

There are more references available in the full text version of this article.

Cited by (17)

A generalization of Nemhauser and Trotters local optimization theorem
2011, Journal of Computer and System Sciences
The Nemhauser–Trotter local optimization theorem applies to the NP-hard Vertex Cover problem and has applications in approximation as well as parameterized algorithmics. We generalize Nemhauser and Trotterʼs result to vertex deletion problems, introducing a novel algorithmic strategy based on purely combinatorial arguments (not referring to linear programming as the Nemhauser–Trotter result originally did). The essence of our strategy can be understood as a doubly iterative process of cutting away “easy parts” of the input instance, finally leaving a “hard core” whose size is (almost) linearly related to the cardinality of the solution set. We exhibit our approach using a generalization of Vertex Cover, called Bounded-Degree Vertex Deletion. For some fixed $d ⩾ 0$ , Bounded-Degree Vertex Deletion asks to delete at most k vertices from a graph in order to transform it into a graph with maximum vertex degree at most d. Vertex Cover is the special case of $d = 0$ . Our generalization of the Nemhauser–Trotter-Theorem implies that Bounded-Degree Vertex Deletion, parameterized by k, admits an $O (k)$ -vertex problem kernel for $d ⩽ 1$ and, for any $ϵ > 0$ , an $O (k^{1 + ϵ})$ -vertex problem kernel for $d ⩾ 2$ . Finally, we provide a W[2]-completeness result for Bounded-Degree Vertex Deletion in case of unbounded d-values.
Colouring semirandom graphs
2007, Combinatorics Probability and Computing
FINDING PLANTED CLIQUES USING MARKOV CHAIN MONTE CARLO
2023, arXiv
Navigating in Trees with Permanently Noisy Advice
2021, ACM Transactions on Algorithms
Strongly refuting all semi-random Boolean CSPs
2021, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Local statistics, semidefinite programming, and community detection
2021, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

View all citing articles on Scopus

^☆: Research supported by the Deutsche Forschungsgemeinschaft (grant DFG FOR 413/1-1). An extended abstract version of this paper has appeared in the Proc. of RANDOM 2002, Lecture Notes in Comput. Sci., vol. 2483, Springer, pp. 139–148.

View full text

Solving NP-hard semirandom graph problems in polynomial expected time☆

Abstract

J. Algorithms

J. Comput. System Sci.

J. Comput. System Sci.

Inform. Process. Lett.

J. Algorithms

Approximating the independence number via the ϑ-function

Math. Programming

Coloring random and semirandom k-colorable graphs

J. Algorithms

Relations between average case complexity and approximation complexity

Finding and certifying a large hidden clique in a semirandom graph

Random Structures Algorithms