A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
From MaRDI portal
Publication:4962177
DOI10.1145/2629654zbMath1398.68661arXiv1302.7270OpenAlexW1972906866MaRDI QIDQ4962177
Claire Mathieu, Glencora Borradaile, Philip N. Klein
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.7270
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (12)
Quasilinear approximation scheme for Steiner multi cycle in the Euclidean plane ⋮ A PTAS for the geometric connected facility location problem ⋮ Randomized approximation scheme for Steiner multi cycle in the Euclidean plane ⋮ Approximations for the Steiner multicycle problem ⋮ A Modern View on Stability of Approximation ⋮ Euclidean prize-collecting Steiner forest ⋮ Unnamed Item ⋮ A PTAS for the Steiner Forest Problem in Doubling Metrics ⋮ A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximation Schemes for Capacitated Geometric Network Design
This page was built for publication: A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
