Minimum Scan Cover and Variants: Theory and Experiments

DOI10.1145/3567674MaRDI QIDQ6127834zbMATH OpenOpenAlexFDO

Authors Kevin Buchin, Sándor P. Fekete, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs

Publication date 14 April 2024

Published in ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3567674

zbMATH Keywords

algorithm engineeringangular metricapproximationbottleneckcomplexityconstraint programmingenergygraph scanningmakespanmixed-integer programming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Minimum scan cover and variants -- theory and experiments
• scientific article; zbMATH DE number 7760172
• Minimum scan cover with angular transition costs
• Minimum covering with travel cost
• Minimum covering with travel cost

Cited in

(1)

• Minimum scan cover and variants -- theory and experiments

This page was built for publication: Minimum Scan Cover and Variants: Theory and Experiments

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