Efficient path and vertex exchange in steiner tree algorithms

DOI10.1002/(SICI)1097-0037(199703)29:2%3C89::AID-NET3%3E3.0.CO;2-7zbMATH Open0888.90142OpenAlexW2096904152MaRDI QIDQ4367276FDOQ4367276

Stefan Voß, Cees Duin

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199703)29:2%3C89::aid-net3%3E3.0.co;2-7

zbMATH Keywords

weighted graphminimum total weight

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cited In (11)

• A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs
• Solving group Steiner problems as Steiner problems.
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs
• Capacitated ring arborescence problems with profits
• A robust and scalable algorithm for the Steiner problem in graphs
• Improved algorithms for the Steiner problem in networks
• Solving Steiner trees: Recent advances, challenges, and perspectives
• Heuristics for the rural postman problem
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals

Uses Software

• OR-Library

   Recommendations

• A faster approximation algorithm for the Steiner problem in graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An Efficient Approximation Algorithm for the Steiner Tree Problem 👍 👎

This page was built for publication: Efficient path and vertex exchange in steiner tree algorithms

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