Min-max coverage problems on tree-like metrics

DOI10.1016/J.PROCS.2023.08.224MaRDI QIDQ6885240zbMATH OpenFDO

Authors Eric Aaron, Ursula Hebert-Johnson, D. Krizanc, Daniel Lokshtanov

Publication date 11 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.PROCS.2023.08.224

zbMATH Keywords

treewidthapproximation algorithmsvehicle routingparameterized algorithmsmin-max coverage

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: Min-max coverage problems on tree-like metrics

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