Publication:2748154
From MaRDI portal
zbMath0985.68092MaRDI QIDQ2748154
Joachim Gudmundsson, Giri Narasimhan, Christos Levcopoulos
Publication date: 14 October 2001
Related Items
Dynamic programming approach to the generalized minimum Manhattan network problem, Minimum Manhattan network is NP-complete, Linear-size planar Manhattan network for convex point sets, On minimum generalized Manhattan connections, The transitive minimum Manhattan subnetwork problem in 3 dimensions, Light orthogonal networks with constant geometric dilation, Approximating the generalized minimum Manhattan network problem, Approximating minimum Manhattan networks in higher dimensions, Minimum Manhattan network problem in normed planes with polygonal balls: a factor 2.5 approximation algorithm, The minimum Manhattan network problem: Approximations and exact solutions, A rounding algorithm for approximating minimum Manhattan networks, A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem, The Minimal Manhattan Network Problem in Three Dimensions