On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods

DOI10.1007/978-3-642-38016-7_9zbMath1394.68415OpenAlexW4243089799MaRDI QIDQ2848917

Diego Seco, Meng He, Akitoshi Kawamura, Reza Dorrigiv, Shahin Kamali, Robert Fraser, Alejandro López-Ortiz

Publication date: 13 September 2013

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38016-7_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Connectivity graphs of uncertainty regions ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Minimizing the diameter of a spanning tree for imprecise points

This page was built for publication: On Minimum-and Maximum-Weight Minimum Spanning Trees with Neighborhoods