scientific article; zbMATH DE number 7651143

DOI10.4230/LIPICS.ESA.2020.4MaRDI QIDQ5874465FDOQ5874465

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

Publication date 7 February 2023

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

zbMATH Keywords

approximation algorithmsSteiner treemulti-level

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 1926656 (Why is no real title available?)
• Dynamic Steiner Tree Problem
• Emergence of Scaling in Random Networks
• Improved approximation algorithms for the quality of service multicast tree problem
• Multi-Level Steiner Trees.
• On the approximability of some network design problems
• Steiner tree approximation via iterative randomized rounding
• The Steiner tree problem on graphs: inapproximability results
• Tighter Bounds for Graph Steiner Tree Approximation

Cited in

(2)

• Multi-Level Steiner Trees.
• Approximation algorithms for priority Steiner tree problems

Describes a project that uses

Uses Software

• SteinLib

This page was built for publication:

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