An Approximation Algorithm to the k-Steiner Forest Problem

DOI10.1007/978-3-540-72504-6_66zbMATH Open1200.68285OpenAlexW4231802065MaRDI QIDQ5425485

Peng Zhang

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_66

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights ⋮ Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth ⋮ A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest

This page was built for publication: An Approximation Algorithm to the k-Steiner Forest Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425485)