Algorithms and Computation
From MaRDI portal
Publication:5897858
DOI10.1007/11602613zbMath1173.68869OpenAlexW2304246803MaRDI QIDQ5897858
Sebastian Seibert, Walter Unger
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11602613
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (8)
Linear-size planar Manhattan network for convex point sets ⋮ A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem ⋮ Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm ⋮ A rounding algorithm for approximating minimum Manhattan networks ⋮ Approximating minimum Manhattan networks in higher dimensions ⋮ Minimum Manhattan network is NP-complete ⋮ The transitive minimum Manhattan subnetwork problem in 3 dimensions ⋮ The Minimal Manhattan Network Problem in Three Dimensions
This page was built for publication: Algorithms and Computation
