Minmax Tree Cover in the Euclidean Space

DOI10.1007/978-3-642-00202-1_18zbMath1211.05130OpenAlexW1502521435MaRDI QIDQ5901435

Hiroshi Nagamochi, Seigo Karakawa, Ehab Morsy

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.231.1280

zbMATH Keywords

graph algorithmsapproximation algorithmsbalanced partitiontree coverminmax tree cover

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Min-max tree covers of graphs.
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
• On the complexity of graph tree partition problems.
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree
• A tabu search heuristic and adaptive memory procedure for political districting
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Approximating the minmax rooted-tree cover in a tree
• Minmax subtree cover problem on cacti
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• BALANCED PARTITION OF MINIMUM SPANNING TREES
• Algorithms and Computation
• Minmax Tree Cover in the Euclidean Space

This page was built for publication: Minmax Tree Cover in the Euclidean Space