Approaches to the Steiner Problem in Networks

DOI10.1007/978-3-642-02094-0_5MaRDI QIDQ3637313zbMATH OpenOpenAlexFDO

Authors Tobias Polzin, Siavash Vahdati Daneshmand

Publication date 9 July 2009

Published in Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02094-0_5

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Steiner problem in networks: A survey
• Improved algorithms for the Steiner problem in networks
• An approach for the Steiner problem in directed graphs
• Steiner tree problems
• Steiner tree problems
• A variational approach to the Steiner network problem
• Steiner problem in Halin networks
• Steiner's problem in graphs: Heuristic methods
• The Steiner problem in graphs: topological methods of solution
• scientific article; zbMATH DE number 4049088

Cites work

• A comparison of Steiner tree relaxations
• A dual ascent approach for steiner tree problems on a directed graph
• Advances in Steiner trees
• An integer linear programming approach to the steiner problem in graphs
• Approaches to the Steiner Problem in Networks
• Dynamic programming for minimum Steiner trees
• Fourier meets M\"{o}bius: fast subset convolution
• scientific article; zbMATH DE number 1670541 (Why is no real title available?)
• scientific article; zbMATH DE number 1670544 (Why is no real title available?)
• scientific article; zbMATH DE number 49566 (Why is no real title available?)
• scientific article; zbMATH DE number 1305468 (Why is no real title available?)
• scientific article; zbMATH DE number 1163724 (Why is no real title available?)
• scientific article; zbMATH DE number 1947441 (Why is no real title available?)
• scientific article; zbMATH DE number 1982172 (Why is no real title available?)
• scientific article; zbMATH DE number 2044939 (Why is no real title available?)
• scientific article; zbMATH DE number 2079349 (Why is no real title available?)
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• scientific article; zbMATH DE number 795222 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• scientific article; zbMATH DE number 1445376 (Why is no real title available?)
• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Improved algorithms for the Steiner problem in networks
• New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
• On Steiner trees and minimum spanning trees in hypergraphs
• Practical Partitioning-Based Methods for the Steiner Problem
• Preprocessing Steiner problems from VLSI layout
• Solving Steiner tree problems in graphs to optimality
• Steiner minimal trees
• Survivable networks, linear programming relaxations and the parsimonious property
• The Steiner tree problem
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets

Cited in

(20)

• An approach for the Steiner problem in directed graphs
• Steiner tree problems
• Steiner's problem in graphs: Heuristic methods
• Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
• The constrained shortest path problem: algorithmic approaches and an algebraic study with generalization
• scientific article; zbMATH DE number 1670544 (Why is no real title available?)
• On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem
• Studies on construction of the Steiner minimum tree problem based on plant growth simulation algorithm
• A degree based approach to find Steiner trees
• Approaches to the Steiner Problem in Networks
• An approximation algorithm for the Steiner connectivity problem
• The Steiner tree problem with delays: a compact formulation and reduction procedures
• Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study
• Implications, conflicts, and reductions for Steiner trees
• Implications, conflicts, and reductions for Steiner trees
• Models for a Steiner ring network design problem with revenues
• Solving Steiner trees: Recent advances, challenges, and perspectives
• The complexity landscape of disaster‐aware network extension problems
• Enabling research through the SCIP Optimization Suite 8.0
• A variational approach to the Steiner network problem

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication: Approaches to the Steiner Problem in Networks

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