Semirandom models as benchmarks for coloring algorithms

Michael Krivelevich, Dan Vilenchik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Semirandom models generate problem instances by blending random and adversarial decisions, thus intermediating between the worst-case assumptions that may be overly pessimistic in many situations, and the easy pure random case. In the Gn,p,k random graph model, the n vertices are partitioned into k color classes each of size n/k. Then, every edge connecting two different color classes is included with probability p = p(n). In the semirandom variant, Gn,p,k,* an adversary may add edges as long as the planted coloring is respected. Feige and Killian prove that unless NP ⊆ BPP, no polynomial time algorithm works whp when np < (1 - ε)ln n, in particular when np is constant. Therefore, it seems like G n,p,k,* is not an interesting benchmark for polynomial time algorithms designed to work whp on sparse instances (np a constant). We suggest two new criteria, using semirandom models, to serve as benchmarks for such algorithms. We also suggest two new coloring heuristics and compare them with the coloring heuristics suggested by Alou and Kahale 1997 and by Böttcher 2005. We prove that in some explicit sense both our heuristics are preferable to the latter.

Original languageEnglish
Title of host publicationProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
PublisherSociety for Industrial and Applied Mathematics (SIAM)
Pages211-221
Number of pages11
ISBN (Print)0898716101, 9780898716108
DOIs
StatePublished - 2006
Event8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics - Miami, FL, United States
Duration: 21 Jan 200621 Jan 2006

Publication series

NameProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Volume2006

Conference

Conference8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Country/TerritoryUnited States
CityMiami, FL
Period21/01/0621/01/06

Fingerprint

Dive into the research topics of 'Semirandom models as benchmarks for coloring algorithms'. Together they form a unique fingerprint.

Cite this