Approximating the minimum independent dominating set in perturbed graphs

DOI10.1016/J.TCS.2013.11.010MaRDI QIDQ744108zbMATH OpenOpenAlexFDO

Authors Weitian Tong, Randy Goebel, Guohui 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 algorithmdominating setindependent setindependent dominating setperturbed graphsmooth analysis

Mathematics Subject Classification ID

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

Recommendations

• Approximating the minimum independent dominating set in perturbed graphs
• On approximating the minimum independent dominating set
• Approximating independent set in perturbed graphs
• scientific article; zbMATH DE number 850313
• Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs
• scientific article; zbMATH DE number 867663
• scientific article; zbMATH DE number 1003268
• Minimum dominating set approximation in graphs of bounded arboricity
• A polynomial-time approximation to a minimum dominating set in a graph
• scientific article; zbMATH DE number 2080196

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• A threshold of ln n for approximating set cover
• Approximating independent set in perturbed graphs
• Approximating the minimum maximal independence number
• Linear degree extractors and the inapproximability of max clique and chromatic number
• On the domination number of a random graph
• Smoothed analysis of algorithms
• The chromatic number of random graphs
• The chromatic number of random graphs
• The greedy coloring is a bad probabilistic algorithm
• The independent domination number of random graph

Cited in

(2)

• Approximating the minimum independent dominating set in perturbed graphs
• Approximating independent set in perturbed graphs

This page was built for publication: Approximating the minimum independent dominating set in perturbed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744108)