Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
From MaRDI portal
Publication:3195329
DOI10.1007/978-3-319-09174-7_18zbMath1445.68158OpenAlexW44696363MaRDI QIDQ3195329
Sandro Montanari, Yann Disser, Matúš Mihalák, Peter Widmayer
Publication date: 16 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_18
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Paths and cycles (05C38) Signed and weighted graphs (05C22)
Related Items
Connectivity graphs of uncertainty regions, Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods, On hub location problems in geographically flexible networks, Shortest Paths in Graphs of Convex Sets, Minimizing the diameter of a spanning tree for imprecise points, Routing for unmanned aerial vehicles: touring dimensional sets
