Approximating the Minimum Independent Dominating Set in Perturbed Graphs

DOI10.1007/978-3-642-38768-5_24zbMath1381.68307OpenAlexW1719847780MaRDI QIDQ4925243

Randy Goebel, Guo-Hui Lin, Weitian Tong

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_24

zbMATH Keywords

approximation algorithmindependent setdominating setindependent dominating setperturbed graphsmooth analysis

Mathematics Subject Classification ID

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

This page was built for publication: Approximating the Minimum Independent Dominating Set in Perturbed Graphs