Publication:4707782
From MaRDI portal
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
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
68U99: Computing methodologies and applications
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
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, A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems, A distributed dual ascent algorithm for Steiner problems in multicast routing, Unnamed Item, Implications, conflicts, and reductions for Steiner trees, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, A robust and scalable algorithm for the Steiner problem in graphs, A relax-and-cut framework for large-scale maximum weight connected subgraph problems, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Thinning out Steiner trees: a node-based model for uniform edge costs, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Solving minimum-cost shared arborescence problems, An algorithmic framework for the exact solution of tree-star problems, Approaches to the Steiner Problem in Networks
Uses Software
