Cost-minimal trees in directed acyclic graphs
From MaRDI portal
Publication:5181099
DOI10.1007/BF01949715zbMath0273.90059MaRDI QIDQ5181099
Ludwig Nastansky, N. F. Stewart, Stanley M. Selkow
Publication date: 1974
Published in: Zeitschrift für Operations Research (Search for Journal in Brave)
Related Items (13)
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem ⋮ Greedy algorithms for the on-line steiner tree and generalized steiner problems ⋮ The Performance of greedy algorithms for the on-line steiner tree and related problems ⋮ Steiner problems on directed acyclic graphs ⋮ Optimal implementation of selectors in a data-base ⋮ Delay-related secondary objectives for rectilinear Steiner minimum trees. ⋮ The rectilinear Steiner arborescence problem ⋮ Linear bounds for on-line Steiner problems ⋮ A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems ⋮ A series of approximation algorithms for the acyclic directed Steiner tree problem ⋮ Approximating the generalized minimum Manhattan network problem ⋮ Two variations of the minimum Steiner problem ⋮ Dynamic programming approach to the generalized minimum Manhattan network problem
Cites Work
- On the Problem of Steiner
- On Steiner’s Problem with Rectilinear Distance
- Steiner Minimal Trees
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Integer Programming by Implicit Enumeration and Balas’ Method
- Steiner's problem in graphs and its implications
- The steiner problem in graphs
- The Generation of Minimal Trees with a Steiner Topology
This page was built for publication: Cost-minimal trees in directed acyclic graphs