A faster approximation algorithm for the Steiner problem in graphs
From MaRDI portal
Publication:5903542
DOI10.1016/0020-0190(88)90066-XzbMath0635.68071MaRDI QIDQ5903542
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A primal-dual approximation algorithm for the Steiner forest problem, An 11/6-approximation algorithm for the network Steiner problem, A data structure for bicategories, with application to speeding up an approximation algorithm, Efficient approximate shortest-path queries among isothetic rectangular obstacles, A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes, A robust and scalable algorithm for the Steiner problem in graphs, The Influence of Preprocessing on Steiner Tree Approximations, On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree, Proximity graphs inside large weighted graphs, The Steiner problem with edge lengths 1 and 2, A factoring approach for the Steiner tree problem in undirected networks, Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks, Solving Steiner trees: Recent advances, challenges, and perspectives, Balancing graph Voronoi diagrams with one more vertex, Solving group Steiner problems as Steiner problems., The weighted farthest color Voronoi diagram on trees and graphs., Efficient and effective community search, Strategyproof auction mechanisms for network procurement, The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs, Fast approximation of minimum multicast congestion – Implementation VERSUS Theory, Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs, Strong Steiner Tree Approximations in Practice, A note on A faster approximation algorithm for the Steiner problem in graphs, Boosting the Exploration of Huge Dynamic Graphs, The multi-weighted Steiner tree problem, Path-distance heuristic for the Steiner problem in undirected networks, Unnamed Item, A series of approximation algorithms for the acyclic directed Steiner tree problem, On small world non-Sunada twins and cellular Voronoi diagrams, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, Heuristics for the Steiner problem in graphs, An algorithmic framework for the exact solution of tree-star problems, Approximating the tree and tour covers of a graph, Survivable networks, linear programming relaxations and the parsimonious property, Steiner's problem in graphs: Heuristic methods, MIP models for connected facility location: a theoretical and computational study, Improved algorithms for the Steiner problem in networks, Heuristic algorithms for packing of multiple-group multicasting, A faster approximation algorithm for the Steiner tree problem in graphs, Lagrangian decompositions for the two-level FTTx network design problem, An exact combinatorial algorithm for minimum graph bisection, Class Steiner trees and VLSI-design, Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation, An efficient approximation algorithm for the survivable network design problem, A Faster Implementation of Zelikovsky's 11/6-Approximation Algorithm for the Steiner Problem in Graphs, Worst-case performance of some heuristics for Steiner's problem in directed graphs, Tree polytope on 2-trees, An improved approximation algorithm for the uniform cost-distance Steiner tree problem
Cites Work
