Hardness results and approximation schemes for discrete packing and domination problems

DOI10.1007/978-3-030-04651-4_28OpenAlexW2900917018MaRDI QIDQ2327121

Apurva Mudgal, Supantha Pandit, Raghunath Reddy Madireddy

Publication date: 11 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-04651-4_28

zbMATH Keywords

local searchdisksaxis-parallel rectanglesdiscrete dominating setdiscrete independent set\(\mathsf{APX}\)-hard\(\mathsf{PTAS}\mathsf{NP}\)-hardaxis-parallel squares

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Maximum independent and disjoint coverage

This page was built for publication: Hardness results and approximation schemes for discrete packing and domination problems