On constant time approximation of parameters of bounded degree graphs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations


How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant time algorithm ? Motivated by results and questions of Nguyen and Onak, and of Parnas, Ron and Trevisan, we show that the best approximation ratio that can be achieved for the first question (independence number) is between Ω(d/logd) and O(d loglogd/ logd), whereas the answer to the second (domination number) is (1 + o(1)) ln d.

Original languageEnglish (US)
Title of host publicationProperty Testing - Current Research and Surveys
Number of pages6
StatePublished - 2010
Externally publishedYes
EventMini-Workshop on Property Testing - Beijing, China
Duration: Jan 8 2010Jan 10 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6390 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


OtherMini-Workshop on Property Testing

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


  • constant time approximation
  • dominating set in a graph
  • independence number of a graph


Dive into the research topics of 'On constant time approximation of parameters of bounded degree graphs'. Together they form a unique fingerprint.

Cite this