Fast LP-based Approximations for Geometric Packing and Covering Problems

DOI10.1137/1.9781611975994.62MaRDI QIDQ5146833zbMATH OpenOpenAlexFDO

Authors Chandra Chekuri, Kent Quanrud, Sariel Har-Peled

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.62

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(5)

• On the geometric set multicover problem
• Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
• Local search strikes again: PTAS for variants of geometric covering and packing
• Computing data distribution from query selectivities
• Approximating densest subgraph in geometric intersection graphs

This page was built for publication: Fast LP-based Approximations for Geometric Packing and Covering Problems

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