scientific article; zbMATH DE number 1979512
From MaRDI portal
Publication:4427856
zbMath1019.68819MaRDI QIDQ4427856
Keiko Imai, Ryo Kato, Takao Asano
Publication date: 14 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180344.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (9)
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 ⋮ The minimum Manhattan network problem: Approximations and exact solutions ⋮ 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:
