An initial study of budgeted Steiner networks

DOI10.57717/CGT.V2I2.26MaRDI QIDQ6179336FDOQ6179336

Authors: Jingjin Yu, Mario Szegedy 

Publication date: 16 December 2023

Recommendations

• Unexplored Steiner ratios in geometric networks
• Two-connected Steiner networks: structural properties
• The Steiner tree problem
• A constrained Steiner tree problem
• Interconnecting networks in the plane: The steiner case

zbMATH Keywords

Steiner treesweighted shortest path networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Reducibility among combinatorial problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Link-Length Minimization in Networks
• The complexity of theorem-proving procedures
• Wiener index of trees: Theory and applications
• Steiner Minimal Trees
• Steiner problem in networks: A survey
• Steiner tree problems
• On the Problem of Steiner
• The complexity of the network design problem
• Title not available (Why is that?)
• Euclidean Steiner minimum trees: An improved exact algorithm
• Optimum Communication Spanning Trees
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• On the history of the Euclidean Steiner tree problem
• Combinatorics. Proceedings of the 5th Czech and Slovak symposium on combinatorics, graph theory, algorithms and applications, Prague, Czech Republic, July 6--11, 1998
• On minimal graphs containing $n$ given points

Cited In (1)

• Models for a Steiner ring network design problem with revenues

This page was built for publication: An initial study of budgeted Steiner networks

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