Approximation Algorithms for the Capacitated Domination Problem

DOI10.1007/978-3-642-14553-7_19zbMath1288.68270arXiv1004.2839OpenAlexW3125939624MaRDI QIDQ3587350

Mong-Jen Kao, Han Lin Chen

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27) 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: Approximation Algorithms for the Capacitated Domination Problem