An Approximation Algorithm to the k-Steiner Forest Problem

DOI10.1007/978-3-540-72504-6_66MaRDI QIDQ5425485zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An approximation algorithm to the \(k\)-Steiner forest problem
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
• Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
• A primal-dual approximation algorithm for the Steiner forest problem
• Approximating k-forest with resource augmentation: a primal-dual approach

Cited in

(9)

• An approximation algorithm to the \(k\)-Steiner forest problem
• Improved approximation algorithm for Steiner k-Forest with nearly uniform weights
• Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
• A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
• Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
• Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing
• Approximating k-forest with resource augmentation: a primal-dual approach
• Approximating \(k\)-forest with resource augmentation: a primal-dual approach
• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing

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)