scientific article; zbMATH DE number 1926656
From MaRDI portal
Publication:4707782
zbMath1014.68771MaRDI QIDQ4707782
Marcus Poggi de Aragão, Renato F. Werneck
Publication date: 11 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2409/24090001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (17)
A robust and scalable algorithm for the Steiner problem in graphs ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ Approximation algorithms for Steiner forest: An experimental study ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ Unnamed Item ⋮ Thinning out Steiner trees: a node-based model for uniform edge costs ⋮ SCIP-Jack -- a solver for STP and variants with parallelization extensions ⋮ Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem ⋮ A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems ⋮ Strong Steiner Tree Approximations in Practice ⋮ Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View ⋮ Solving minimum-cost shared arborescence problems ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Approaches to the Steiner Problem in Networks
Uses Software
This page was built for publication:
