The partial sum criterion for Steiner trees in graphs and shortest paths

DOI10.1016/S0377-2217(96)00113-0zbMATH Open0922.90139OpenAlexW1970505537MaRDI QIDQ1278596FDOQ1278596

Cees Duin, A. Volgenant

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00113-0

Recommendations

• An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions
• scientific article; zbMATH DE number 222076
• The bottleneck selected‐internal and partial terminal Steiner tree problems
• A faster approximation algorithm for the Steiner problem in graphs

zbMATH Keywords

bottleneck spanning treebottleneck shortest pathminmax Steiner tree problempartial sum criterion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Fibonacci heaps and their uses in improved network optimization algorithms
• The Steiner tree problem
• Some generalizations of the steiner problem in graphs
• Title not available (Why is that?)
• The Min-Max Spanning Tree Problem and some extensions
• A linear time algorithm for the maximum capacity path problem
• On \(k\)-sum optimization
• k-sum optimization problems
• An augmenting path method for solving linear bottleneck assignment problems
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• k-Eccentricity and absolute k-centrum of a probabilistic tree
• Shortest Path and Network Flow Algorithms
• Title not available (Why is that?)
• Reduction tests for the steiner problem in grapsh
• On minimizing the sum of \(k\) tardinesses
• Finding k edge-disjoint spanning trees of minimum total weight in a network: An application of matroid theory
• K-Sum Linear Programming

Cited In (8)

• Bridging \(k\)-sum and CVaR optimization in MILP
• The Euclidean bottleneck full Steiner tree problem
• Fast algorithm for multicast and data gathering in wireless networks
• Improved polynomial algorithms for robust bottleneck problems with interval data
• Bottleneck Steiner tree with bounded number of Steiner vertices
• The bottleneck \(k\)-MST
• A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death
• Solving some lexicographic multi-objective combinatorial problems

This page was built for publication: The partial sum criterion for Steiner trees in graphs and shortest paths

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