scientific article; zbMATH DE number 7651143

DOI10.4230/LIPIcs.ESA.2020.4MaRDI QIDQ5874465

Stephen G. Kobourov, Reyan Ahmed, Richard Spence, Faryad Darabi Sahneh, Keaton Hamm

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/2002.06421

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmsSteiner treemulti-level

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

Approximation algorithms for priority Steiner tree problems

Uses Software

• SteinLib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem on graphs: inapproximability results
• Improved approximation algorithms for the quality of service multicast tree problem
• Emergence of Scaling in Random Networks
• Dynamic Steiner Tree Problem
• On the approximability of some network design problems
• Multi-Level Steiner Trees.
• Tighter Bounds for Graph Steiner Tree Approximation
• Steiner Tree Approximation via Iterative Randomized Rounding

This page was built for publication: