A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs

DOI10.1016/S1571-0653(04)00378-6zbMath1184.68635MaRDI QIDQ3438968

P. Guitart

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Cites Work

• An 11/6-approximation algorithm for the network Steiner problem
• Efficient path and vertex exchange in steiner tree algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs