Approximation algorithms for union and intersection covering problems

DOI10.4230/LIPICS.FSTTCS.2011.28MaRDI QIDQ2911608zbMATH OpenOpenAlexFDO

Authors Marek Cygan, Fabrizio Grandoni, Marcin Mucha, Marcin Pilipczuk, Piotr Sankowski, Stefano Leonardi

Publication date 31 August 2012

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2011.28

zbMATH Keywords

approximation algorithmspartial covering problems

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Approximation algorithms for the covering Steiner problem
• scientific article; zbMATH DE number 1754596
• scientific article; zbMATH DE number 5899242
• scientific article; zbMATH DE number 1445321

Cited in

(4)

• The maximum exposure problem
• Efficient maintenance of the union of intervals on a line, with applications
• The Maximum Exposure Problem.
• Connected k-center and k-diameter clustering

This page was built for publication: Approximation algorithms for union and intersection covering problems

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