A polynomial time approximation scheme for the problem of interconnecting highways

DOI10.1023/A:1011497227406zbMath1078.90062OpenAlexW1502134938MaRDI QIDQ5952321

Joon-Mo Kim, Xiuzhen Cheng, Bing Lu

Publication date: 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011497227406

zbMATH Keywords

dynamic programmingpatchingminimum Steiner tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Dynamic programming (90C39) Traffic problems in operations research (90B20) Approximation algorithms (68W25)

Related Items (1)

TRAVELING SALESMAN PROBLEM OF SEGMENTS

This page was built for publication: A polynomial time approximation scheme for the problem of interconnecting highways