Extending reduction techniques for the Steiner tree problem

DOI10.1007/3-540-45749-6_69MaRDI QIDQ4411411zbMATH OpenFDO

Authors Tobias Polzin, Siavash Vahdati Daneshmand

Publication date 8 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610795.htm

zbMATH Keywords

ReductionsSteiner Problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reduction tests for the steiner problem in grapsh
• On reductions for the Steiner problem in graphs
• Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
• scientific article; zbMATH DE number 1163709
• Reduction tests for the prize-collecting Steiner problem

Cited in

(20)

• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• SCIP-Jack -- a solver for STP and variants with parallelization extensions
• On Steiner trees and minimum spanning trees in hypergraphs
• Reduction tests for the prize-collecting Steiner problem
• Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem
• The influence of preprocessing on Steiner tree approximations
• Approaches to the Steiner Problem in Networks
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• Reduction tests for the steiner problem in grapsh
• scientific article; zbMATH DE number 1163709 (Why is no real title available?)
• Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
• Strong Steiner tree approximations in practice
• Reductions for the rectilinear steiner tree problem
• On the Exact Solution of Prize-Collecting Steiner Tree Problems
• New Reduction Techniques for the Group Steiner Tree Problem
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees
• A linear programming based approach to the Steiner tree problem with a fixed number of terminals
• Solving Steiner trees: Recent advances, challenges, and perspectives
• On reductions for the Steiner problem in graphs

This page was built for publication: Extending reduction techniques for the Steiner tree problem

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