Some generalizations of the steiner problem in graphs

DOI10.1002/NET.3230170309MaRDI QIDQ3787806zbMATH OpenOpenAlexFDO

Authors Cees 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

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

Recommendations

• A strong lower bound for the Node Weighted Steiner Tree Problem
• Problems with generalized Steiner problems
• scientific article; zbMATH DE number 49566
• Problem reduction methods and a tree generation algorithm for the steiner network problem
• scientific article; zbMATH DE number 4010182

Cited in

(34)

• Generalized Steiner problem in outerplanar networks
• An edge elimination test for the Steiner problem in graphs
• Reducing the hierarchical network design problem
• The multi-weighted Steiner tree problem
• Problems with generalized Steiner problems
• The partial sum criterion for Steiner trees in graphs and shortest paths
• The Steiner tree polytope and related polyhedra
• A primal-dual approximation algorithm for the Steiner forest problem
• Generalized network design problems.
• Algorithmic expedients for the prize collecting Steiner tree problem
• A note on the generalized Steiner tree polytope
• A fast prize-collecting Steiner forest algorithm for functional analyses in biological networks
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games
• A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem
• Generalised \(k\)-Steiner tree problems in normed planes
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• A new generalization of the Steiner formula and the Holditch theorem
• Optimal relay node placement in delay constrained wireless sensor network design
• A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
• scientific article; zbMATH DE number 4008433 (Why is no real title available?)
• scientific article; zbMATH DE number 49566 (Why is no real title available?)
• scientific article; zbMATH DE number 179003 (Why is no real title available?)
• A test problem generator for the Steiner problem in graphs
• A strong lower bound for the Node Weighted Steiner Tree Problem
• Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
• scientific article; zbMATH DE number 1532673 (Why is no real title available?)
• The edge-disjoing steiner problem in graphs
• scientific article; zbMATH DE number 1424551 (Why is no real title available?)
• Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms
• On the solution of the generalized steiner problem by the subgradient method
• Improved algorithms for the Steiner problem in networks
• Solving Steiner trees: Recent advances, challenges, and perspectives
• On combining conventional point-to-point and automated waste collection systems
• The general Steiner problem in Boolean space and application

This page was built for publication: Some generalizations of the steiner problem in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787806)