Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing

DOI10.1007/11841036_54zbMath1131.68595OpenAlexW2173641041MaRDI QIDQ5449562

Gil Segev, Danny Segev

Publication date: 11 March 2008

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

Full work available at URL: https://doi.org/10.1007/11841036_54

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Approximation algorithms (68W25)

Related Items (2)

Approximating \(k\)-generalized connectivity via collapsing HSTs ⋮ An approximation algorithm to the \(k\)-Steiner forest problem

This page was built for publication: Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing