Multi-level Steiner trees

DOI10.1145/3368621MaRDI QIDQ4984869zbMATH OpenOpenAlexWikidataFDO

Authors Reyan Ahmed, Patrizio Angelini, Faryad Darabi Sahneh, David Glickenstein, Martin Gronemann, Niklas Heinsohn, Stephen G. Kobourov, Richard Spence, Joseph C. Watkins, Alexander Wolff, 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)

Recommendations

• Multi-Level Steiner Trees.
• The Multi-Tier Tree Problem
• Improved approximation algorithms for the quality of service Steiner tree problem.
• scientific article; zbMATH DE number 1445376
• Computing and Combinatorics

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 970831 (Why is no real title available?)
• A comparison of Steiner tree relaxations
• Collective dynamics of `small-world' networks
• Emergence of Scaling in Random Networks
• Grade of service Steiner minimum trees in the Euclidean plane
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Improved approximation algorithms for the quality of service multicast tree problem
• Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem
• On the approximability of some network design problems
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Reducibility among combinatorial problems
• Steiner Minimal Trees
• Steiner problem in networks: A survey
• Steiner tree approximation via iterative randomized rounding
• The Multi-Tier Tree Problem
• The Steiner problem with edge lengths 1 and 2
• The Steiner tree problem on graphs: inapproximability results
• The Structure and Function of Complex Networks
• Tighter Bounds for Graph Steiner Tree Approximation

Cited in

(3)

• Two-level hub Steiner trees
• Multi-Level Steiner Trees.
• The Multi-Tier Tree Problem

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

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