Multi-level Steiner Trees

DOI10.1145/3368621OpenAlexW2995082188WikidataQ126581817 ScholiaQ126581817MaRDI QIDQ4984869

Faryad Darabi Sahneh, Richard Spence, Stephen G. Kobourov, Alexander Wolff, Niklas Heinsohn, David Glickenstein, Joseph C. Watkins, Martin Gronemann, Reyan Ahmed, Patrizio Angelini, Alon Efrat

Publication date: 21 April 2021

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3368621

zbMATH Keywords

approximation algorithmSteiner treemulti-level graph representation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The Steiner tree problem on graphs: inapproximability results
• The Steiner problem with edge lengths 1 and 2
• Improved approximation algorithms for the quality of service multicast tree problem
• Emergence of Scaling in Random Networks
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Steiner problem in networks: A survey
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• The Structure and Function of Complex Networks
• On the approximability of some network design problems
• Reducibility among Combinatorial Problems
• Tighter Bounds for Graph Steiner Tree Approximation
• Collective dynamics of ‘small-world’ networks
• Steiner Tree Approximation via Iterative Randomized Rounding
• Steiner Minimal Trees
• The Multi-Tier Tree Problem
• A comparison of Steiner tree relaxations
• Grade of service Steiner minimum trees in the Euclidean plane

This page was built for publication: Multi-level Steiner Trees