Some generalizations of the steiner problem in graphs

DOI10.1002/net.3230170309zbMath0644.90088OpenAlexW2007418721MaRDI QIDQ3787806

Cees W. Duin, A. Volgenant

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170309

zbMATH Keywords

minimum spanning treeminimum total weightNode-weighted Steiner ProblemSteiner Forest ProblemSteiner Problem in Graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10)

Related Items

A primal-dual approximation algorithm for the Steiner forest problem, Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games, Optimal relay node placement in delay constrained wireless sensor network design, An edge elimination test for the Steiner problem in graphs, Reducing the hierarchical network design problem, Solving Steiner trees: Recent advances, challenges, and perspectives, A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem, Algorithmic expedients for the prize collecting Steiner tree problem, A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM, A note on the generalized Steiner tree polytope, The multi-weighted Steiner tree problem, A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks, Improved algorithms for the Steiner problem in networks, Generalized network design problems., The partial sum criterion for Steiner trees in graphs and shortest paths, An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem, The Steiner tree polytope and related polyhedra