Capacitated Domination Faster Than O(2 n )

DOI10.1007/978-3-642-13731-0_8zbMath1285.68063MaRDI QIDQ3569880

Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk

Publication date: 22 June 2010

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-13731-0_8

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

68W25: Approximation algorithms