Steiner problems on directed acyclic graphs

DOI10.1007/3-540-61332-3_135zbMath1529.68214MaRDI QIDQ6183625

Da-Wei Wang, Der-Tsai Lee, Unnamed Author, Tsan-sheng Hsu

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• The rectilinear Steiner arborescence problem
• The Steiner tree problem
• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• Directed Steiner problems with connectivity constraints
• A dual ascent approach for steiner tree problems on a directed graph
• Steiner problem in networks: A survey
• An integer linear programming approach to the steiner problem in graphs
• Finding a minimum equivalent graph of a digraph
• Cost-minimal trees in directed acyclic graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Steiner's problem in graphs and its implications
• The steiner problem in graphs
• Steiner tree problems

This page was built for publication: Steiner problems on directed acyclic graphs