Minimum Spanning Tree with Neighborhoods

DOI10.1007/978-3-540-72870-2_29zbMath1137.68615OpenAlexW1935379866MaRDI QIDQ5434449

Yulai Xie, Jinhui Xu, Yang Yang, Mingen Lin

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72870-2_29

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (12)

A joint optimization of data ferry trajectories and communication powers of ground sensors for long-term environmental monitoring ⋮ Connectivity graphs of uncertainty regions ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ Shortest Paths in Graphs of Convex Sets ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Euclidean minimum spanning trees with independent and dependent geometric uncertainties ⋮ Routing for unmanned aerial vehicles: touring dimensional sets ⋮ On the longest spanning tree with neighborhoods ⋮ Minimum cost \(b\)-matching problems with neighborhoods ⋮ On minimum- and maximum-weight minimum spanning trees with neighborhoods

This page was built for publication: Minimum Spanning Tree with Neighborhoods