Approaches to the Steiner Problem in Networks

DOI10.1007/978-3-642-02094-0_5zbMath1248.68069OpenAlexW1502956502MaRDI QIDQ3637313

Siavash Vahdati Daneshmand, Tobias Polzin

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

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

Related Items (5)

Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks

Uses Software

• SteinLib

Cites Work

• 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
• Steiner minimal trees
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• On Steiner trees and minimum spanning trees in hypergraphs
• Advances in Steiner trees
• Dynamic programming for minimum Steiner trees
• A dual ascent approach for steiner tree problems on a directed graph
• New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
• Fourier meets M\"{o}bius: fast subset convolution
• Approaches to the Steiner Problem in Networks
• An integer linear programming approach to the steiner problem in graphs
• Solving Steiner tree problems in graphs to optimality
• Preprocessing Steiner problems from VLSI layout
• Practical Partitioning-Based Methods for the Steiner Problem
• A comparison of Steiner tree relaxations
• Improved algorithms for the Steiner problem in networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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