The two-squirrel problem and its relatives

DOI10.1007/978-3-032-00281-5_8MaRDI QIDQ6866979zbMATH OpenFDO

Authors Sergey Bereg, Yuya Higashikawa, Naoki Katoh, László Kozma, Manuel Lafond, Günter Rote, Yuki Tokuni, Max Willert, Binhai Zhu

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-3-032-00281-5_8

zbMATH Keywords

approximation algorithmsminimum spanning tree (MST)minimum star/tree coverNP-hardnessset-partitionTSP

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Applications of game theory (91A80)

Cites work

• Approximation to the Minimum Rooted Star Cover Problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• scientific article; zbMATH DE number 3912403 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7758359 (Why is no real title available?)
• On strong NP-completeness of rational problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Reducibility among combinatorial problems

This page was built for publication: The two-squirrel problem and its relatives

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