Minmax Tree Cover in the Euclidean Space
From MaRDI portal
Publication:5891341
DOI10.7155/jgaa.00230zbMath1276.05115OpenAlexW2024747753MaRDI QIDQ5891341
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi
Publication date: 28 November 2013
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7155/jgaa.00230
Trees (05C05) Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Unnamed Item ⋮ New LP relaxations for minimum cycle/path/tree cover problems ⋮ Minmax Tree Cover in the Euclidean Space
This page was built for publication: Minmax Tree Cover in the Euclidean Space
