Heuristics for Semirandom Graph Problems

Heuristics for Semirandom Graph Problems (2001)

Cached

Download Links

[www.wisdom.weizmann.ac.il]

Other Repositories/Bibliography

DBLP

by Uriel Feige , Joe Kilian

Venue:	Journal of Computing and System Sciences
Citations:	29 - 4 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Heuristics for Semirandom Graph Problems	INFERENCE
AUTHOR NAME	Uriel Feige	SVM HeaderParse 0.1
AUTHOR AFFIL	y	SVM HeaderParse 0.2
AUTHOR NAME	Joe Kilian	SVM HeaderParse 0.1
AUTHOR ADDR	NEC Research Institute, 4 Independence Way, Princeton, New Jersey	SVM HeaderParse 0.1
ABSTRACT	We consider semirandom graph models for finding large independent sets, colorings and bisections in graphs. These models generate problem instances by blending random and adversarial decisions. To generate semirandom independent set problems, an independent set S of ffn vertices is randomly chosen. Each edge connecting S with S is chosen with probability p, and an adversary is then allowed to add new edges arbitrarily, provided that S remains an independent set. The smaller p is, the greater the control the adversary has over the semirandom graph. We give a heuristic that with high probability recovers an independent set of size ffn whenever p? (1 + ffl) ln n=ffn, for any constant ffl? 0. We show that when p! (1 \Gamma ffl) ln n=ffn, an independent set of size jSj cannot be recovered, unless NP ` BPP. We use our result for maximum independent sets to obtain greatly improved heuristics for the model of k-colorable semirandom graphs introduced by Blum and Spencer. For constant k, our results are optimal up to constant factors in the edge probabilities.. In the semirandom model for graph bisection, a random bisection	SVM HeaderParse 0.1
YEAR	2001	INFERENCE
VENUE	Journal of Computing and System Sciences	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	639--671	INFERENCE
VOLUME	63	INFERENCE
CITATIONS	22 found	ParsCit 1.0