Capacitated Domination: Constant Factor Approximations for Planar Graphs

DOI10.1007/978-3-642-25591-5_51zbMath1311.68190arXiv1108.4606OpenAlexW1541318985MaRDI QIDQ3104645

Mong-Jen Kao, Der-Tsai Lee

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4606

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (1)

Capacitated domination: problem complexity and approximation algorithms

This page was built for publication: Capacitated Domination: Constant Factor Approximations for Planar Graphs