Approximating the minimum independent dominating set in perturbed graphs

DOI10.1016/j.tcs.2013.11.010zbMath1305.05181OpenAlexW2039459495MaRDI QIDQ744108

Weitian Tong, Randy Goebel, Guo-Hui Lin

Publication date: 6 October 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.010

zbMATH Keywords

approximation algorithmindependent setdominating setindependent dominating setperturbed graphsmooth analysis

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the minimum maximal independence number
• Approximating independent set in perturbed graphs
• A threshold of ln n for approximating set cover
• Smoothed analysis of algorithms
• The greedy coloring is a bad probabilistic algorithm
• The chromatic number of random graphs
• The chromatic number of random graphs
• On the domination number of a random graph