Approaches to the Steiner Problem in Networks

DOI10.1007/978-3-642-02094-0_5zbMATH Open1248.68069OpenAlexW1502956502MaRDI QIDQ3637313FDOQ3637313

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

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

Mathematics Subject Classification ID

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

Cites Work

• Solving Steiner tree problems in graphs to optimality
• Title not available (Why is that?)
• The Steiner tree problem
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fourier meets M\"{o}bius: fast subset convolution
• A comparison of Steiner tree relaxations
• Improved algorithms for the Steiner problem in networks
• A dual ascent approach for steiner tree problems on a directed graph
• Title not available (Why is that?)
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Title not available (Why is that?)
• On Steiner trees and minimum spanning trees in hypergraphs
• Title not available (Why is that?)
• Steiner minimal trees
• Dynamic programming for minimum Steiner trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Preprocessing Steiner problems from VLSI layout
• Title not available (Why is that?)
• New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
• An integer linear programming approach to the steiner problem in graphs
• Title not available (Why is that?)
• Survivable networks, linear programming relaxations and the parsimonious property
• Practical Partitioning-Based Methods for the Steiner Problem
• Title not available (Why is that?)
• Advances in Steiner trees
• Approaches to the Steiner Problem in Networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (20)

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

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)