scientific article

Akira Matsuyama, Hiromitsu Takahashi

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

approximation algorithm Steiner problem connected subgraph

Extremal problems in graph theory (05C35) Connectivity (05C40) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

A branch-and-price algorithm for switch-box routing, Comparison of formulations and a heuristic for packing Steiner trees in a graph, RNC-approximation algorithms for the steiner problem, A data structure for bicategories, with application to speeding up an approximation algorithm, Steiner problem in Halin networks, A robust and scalable algorithm for the Steiner problem in graphs, A survey of combinatorial optimization problems in multicast routing, A relax-and-cut framework for large-scale maximum weight connected subgraph problems, The Influence of Preprocessing on Steiner Tree Approximations, Distributed multicast routing in point-to-point networks, On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree, A tabu search approach for solving a difficult forest harvesting machine location problem, Worst-case performance of Rayward-Smith's Steiner tree heuristic, The network design problem with relays, Fast heuristic algorithms for rectilinear Steiner trees, A factoring approach for the Steiner tree problem in undirected networks, The rainbow Steiner tree problem, A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees, Robust reoptimization of Steiner trees, Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems, On the low-dimensional Steiner minimum tree problem in Hamming metric, Solving Steiner trees: Recent advances, challenges, and perspectives, Navigational guidance -- a deep learning approach, A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints, Unnamed Item, Approximating the Generalized Capacitated Tree-Routing Problem, SCIP-Jack -- a solver for STP and variants with parallelization extensions, Ordered scheduling in control-flow distributed transactional memory, Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints, Solving group Steiner problems as Steiner problems., Strategyproof auction mechanisms for network procurement, 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, Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, An improved decomposition-based heuristic to design a water distribution network for an irrigation system, Strong Steiner Tree Approximations in Practice, A tabu search heuristic for the generalized minimum spanning tree problem, An Efficient Approximation Algorithm for the Steiner Tree Problem, Branch-and-bound as a higher-order function, The multi-weighted Steiner tree problem, The role of Steiner hulls in the solution to Steiner tree problems, Path-distance heuristic for the Steiner problem in undirected networks, The Steiner tree problem with delays: a compact formulation and reduction procedures, The Bursty Steiner Tree Problem, Definition and algorithms for reliable Steiner tree problem, An improved algorithm for the Steiner tree problem with bounded edge-length, Decomposition methods for the two-stage stochastic Steiner tree problem, A series of approximation algorithms for the acyclic directed Steiner tree problem, Binary Steiner trees: structural results and an exact solution approach, Solving minimum-cost shared arborescence problems, Heuristics for the Steiner problem in graphs, Viral systems: A new bio-inspired optimisation approach, Survivable networks, linear programming relaxations and the parsimonious property, Steiner's problem in graphs: Heuristic methods, A faster approximation algorithm for the Steiner problem in graphs, A faster approximation algorithm for the Steiner problem in graphs, Distributed transactional memory for general networks, Worst-case performance of Wong's Steiner tree heuristic, Minimizing maximum risk for fair network connection with interval data, A note on distributed multicast routing in point-to-point networks, Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems, Graph theory (algorithmic, algebraic, and metric problems), Mathematical methods for physical layout of printed circuit boards: an overview, The generalized reserve set covering problem with connectivity and buffer requirements, Heuristic algorithms for packing of multiple-group multicasting, Implications, conflicts, and reductions for Steiner trees, A faster approximation algorithm for the Steiner tree problem in graphs, Implications, conflicts, and reductions for Steiner trees, Class Steiner trees and VLSI-design, Unnamed Item, Unnamed Item, Generalized spanning trees, The incremental connected facility location problem, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Improved methods for approximating node weighted Steiner trees and connected dominating sets., The Steiner problem in distributed computing systems, Worst-case performance of some heuristics for Steiner's problem in directed graphs, Non delayed relax-and-cut algorithms, Upper and lower bounding strategies for the generalized minimum spanning tree problem