GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS
From MaRDI portal
Publication:3089095
DOI10.1142/S0218195911003688zbMath1231.05242OpenAlexW1996406174MaRDI QIDQ3089095
Publication date: 23 August 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195911003688
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Linear programming (90C05) Dynamic programming (90C39) Approximation algorithms (68W25)
Related Items
Linear-size planar Manhattan network for convex point sets ⋮ Approximating the generalized minimum Manhattan network problem ⋮ Approximating minimum Manhattan networks in higher dimensions
Cites Work
This page was built for publication: GREEDY CONSTRUCTION OF 2-APPROXIMATE MINIMUM MANHATTAN NETWORKS