Dispersing obnoxious facilities on graphs by rounding distances

DOI10.4230/LIPICS.MFCS.2022.55MaRDI QIDQ6584057zbMATH OpenFDO

Authors Tim A. Hartmann, Stefan Lendl

Publication date 6 August 2024

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2022.55

zbMATH Keywords

facility locationpackingparameterized complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(3)

• Approximating -covering
• From Chinese postman to salesman and beyond: shortest tour -covering all points on all edges
• Independence and domination on bounded-treewidth graphs: integer, rational, and irrational distances

This page was built for publication: Dispersing obnoxious facilities on graphs by rounding distances

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