Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem
From MaRDI portal
Publication:1850838
DOI10.1023/A:1012730702524zbMath1012.90048OpenAlexW1601518330MaRDI QIDQ1850838
Bing Lu, Xiuzhen Cheng, Bhaskar Das Gupta
Publication date: 15 December 2002
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012730702524
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
This page was built for publication: Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem
