Efficient path and vertex exchange in steiner tree algorithms

DOI10.1002/(SICI)1097-0037(199703)29:2%3C89::AID-NET3%3E3.0.CO;2-7MaRDI QIDQ4367276zbMATH OpenOpenAlexFDO

Authors Cees Duin, Stefan Voß

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

minimum total weightweighted graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A faster approximation algorithm for the Steiner problem in graphs
• scientific article; zbMATH DE number 1445376
• scientific article; zbMATH DE number 222076
• An Efficient Approximation Algorithm for the Steiner Tree Problem

Cited in

(13)

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

Describes a project that uses

Uses Software

• OR-Library

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)