Approximation Algorithms for Domatic Partitions of Unit Disk Graphs

DOI10.1007/978-3-642-03685-9_24zbMath1255.68310OpenAlexW1675952514MaRDI QIDQ3638887

Saurav Pandit, Kasturi R. Varadarajan, Sriram V. Pemmaraju

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

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

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)

Related Items (2)

A weakly robust PTAS for minimum clique partition in unit disk graphs ⋮ Optimally decomposing coverings with translates of a convex polygon

This page was built for publication: Approximation Algorithms for Domatic Partitions of Unit Disk Graphs