Multiobjective Disk Cover Admits a PTAS

DOI10.1007/978-3-540-92182-0_7zbMATH Open1183.68743OpenAlexW1595931673MaRDI QIDQ3596705FDOQ3596705

Authors: Christian Glaßer, Christian Reitwießner, H. Schmitz 

Publication date: 29 January 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_7

Recommendations

• A PTAS for the disk cover problem of geometric objects
• A constant-factor approximation for multi-covering with disks
• A note on multicovering with disks
• A constant-factor approximation for multi-covering with disks
• Polynomial time approximation schemes for minimum disk cover problems

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (2)

• On partial covering for geometric set systems
• A PTAS for the disk cover problem of geometric objects

This page was built for publication: Multiobjective Disk Cover Admits a PTAS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596705)