Capacitated domination problems on planar graphs
From MaRDI portal
Publication:1644918
DOI10.1007/978-3-319-89441-6_1zbMath1484.68150arXiv1604.04664OpenAlexW2795278565MaRDI QIDQ1644918
Publication date: 22 June 2018
Full work available at URL: https://arxiv.org/abs/1604.04664
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (2)
Capacitated covering problems in geometric spaces ⋮ Capacitated Covering Problems in Geometric Spaces
This page was built for publication: Capacitated domination problems on planar graphs
