Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.22005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3106892521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rooted Maximum Node-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact approaches for solving robust prize-collecting Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-cut framework for large-scale maximum weight connected subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incremental connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for solving singular two point boundary value problems: analytical and numerical treatment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs with Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational methods in systems biology. 7th international conference, CMSB 2009, Bologna, Italy, August 31--September 1, 2009. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Based Local Search for the Connected Facility Location and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate robust optimization for the connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact sample average approximation approach for the stochastic connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SST-based algorithm for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Influence of Preprocessing on Steiner Tree Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Steiner Tree Approximations in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian decompositions for the two-level FTTx network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the history of the Euclidean Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal interconnection trees in the plane. Theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for node‐weighted Steiner tree and maximum‐weight connected subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case performance of Wong's Steiner tree heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Imposing Connectivity Constraints in Forest Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphic LP Relaxations for Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regenerator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obtaining optimal <i>k</i> -cardinality trees fast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Steiner tree algorithms for bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction-Based Steiner Tree Approximations in Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Steiner Tree Problem on a Graph Using Branch and Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem. II: Properties and classes of facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wildlife corridors as a connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connections in Networks: Hardness of Feasibility Versus Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the node weighted Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Problems With Profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connected Subgraph Problems in Wildlife Conservation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed dual ascent algorithm for Steiner problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some generalizations of the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving group Steiner problems as Steiner problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient path and vertex exchange in steiner tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong lower bound for the Node Weighted Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insight into the computation of Steiner minimal trees in Euclidean space of general dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharing the cost of multicast transmissions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal spanning trees with a constraint on the number of leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger path‐based extended formulation for the Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of two Steiner arborescence polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted <i>k</i>‐cardinality trees: Complexity and polyhedral structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thinning out Steiner trees: a node-based model for uniform edge costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap-vertex based neighborhood for Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum-leaf spanning tree problem: Formulations and facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: SCIP-Jack -- a solver for STP and variants with parallelization extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arborescence polytopes for series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree polytope and related polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A catalog of steiner tree formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and integrality gaps for hypergraphic steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the capacitated connected facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP models for connected facility location: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hop constrained Steiner trees with multiple root nodes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered graph approaches for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-weighted Steiner tree problem: A reformulation by intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards optimizing the deployment of optical access networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Steiner tree problems in graphs to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partition-based relaxation for Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connected facility location polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for the two-stage stochastic Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of tree-star problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the steiner tree problem in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP-based approach to solve the prize-collecting local access network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non delayed relax-and-cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3760270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree polytope on 2-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-arborescence star problem: formulations and exact solution approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distributed multicast routing in point-to-point networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial optimization problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Selection of a Connected Reserve Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph theory approach for designing conservation reserve networks with minimal fragmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A robust and scalable algorithm for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4707782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of Steiner tree relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for the Steiner problem in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Steiner trees and minimum spanning trees in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Partitioning-Based Methods for the Steiner Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to the Steiner Problem in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Science - ICCS 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining NP-Hard Reduction Techniques and Strong Heuristics in an Exact Algorithm for the Maximum-Weight Connected Subgraph Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction techniques for the prize collecting Steiner tree problem and the maximum-weight connected subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the generalized Steiner tree polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node-weighted steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming based approach to the Steiner tree problem with a fixed number of terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3874241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the prize-collecting Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Steiner problems from VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Local Search for Steiner Trees in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search for the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel local search for Steiner trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs: Heuristic methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithm for optimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions for the rectilinear steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Steiner minimum trees: An improved exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual ascent approach for steiner tree problems on a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted swap-based neighborhood search for the minimum connected dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectilinear group Steiner trees and applications in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster approximation algorithm for the Steiner tree problem in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:57, 21 August 2024

scientific article; zbMATH DE number 7775259
Language Label Description Also known as
English
Solving Steiner trees: Recent advances, challenges, and perspectives
scientific article; zbMATH DE number 7775259

    Statements

    Solving Steiner trees: Recent advances, challenges, and perspectives (English)
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    combinatorial optimization
    0 references
    exact methods
    0 references
    heuristics
    0 references
    integer programming
    0 references
    Steiner tree problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references