Fast Algorithms for min independent dominating set

DOI10.1007/978-3-642-13284-1_20zbMath1284.05270OpenAlexW2569523145MaRDI QIDQ3569130

Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos

Publication date: 17 June 2010

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13284-1_20

Mathematics Subject Classification ID

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

Related Items (4)

Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation ⋮ The many facets of upper domination ⋮ Inclusion/exclusion meets measure and conquer ⋮ Upper Domination: Complexity and Approximation

This page was built for publication: Fast Algorithms for min independent dominating set