A faster approximation algorithm for the Steiner tree problem in graphs

DOI10.1016/0020-0190(93)90201-JzbMATH Open0770.68078OpenAlexW2032228390MaRDI QIDQ1802062FDOQ1802062

Authors: Alex Zelikovsky 

Publication date: 8 August 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90201-j

Recommendations

• A faster approximation algorithm for the Steiner problem in graphs
• A faster approximation algorithm for the Steiner problem in graphs
• scientific article; zbMATH DE number 4063109
• scientific article; zbMATH DE number 1445376
• scientific article; zbMATH DE number 4049088

zbMATH Keywords

approximation algorithmscombinatorial problemsSteiner tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• Title not available (Why is that?)
• Fast Algorithms for Finding Nearest Common Ancestors
• Title not available (Why is that?)
• A faster approximation algorithm for the Steiner problem in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

• The Power of Dynamic Distance Oracles
• An Efficient Approximation Algorithm for the Steiner Tree Problem
• An improved approximation scheme for the Group Steiner Problem
• Title not available (Why is that?)
• Faster algorithm for optimum Steiner trees
• The Clustered Selected-Internal Steiner Tree Problem
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem
• A note on A faster approximation algorithm for the Steiner problem in graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Approximating the tree and tour covers of a graph
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Steiner trees and polyhedra
• A parallel algorithm for computing Steiner trees in strongly chordal graphs
• On efficient implementation of an approximation algorithm for the Steiner tree problem
• A faster approximation algorithm for the Steiner problem in graphs
• Strong Steiner tree approximations in practice
• Digital data networks design using genetic algorithms
• A fast algorithm for computing steiner edge connectivity
• The influence of preprocessing on Steiner tree approximations

This page was built for publication: A faster approximation algorithm for the Steiner tree problem in graphs

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