scientific article; zbMATH DE number 7651143

DOI10.4230/LIPICS.ESA.2020.4MaRDI QIDQ5874465FDOQ5874465

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 of this publication is not available (Why is that?)

zbMATH Keywords

approximation algorithmsSteiner treemulti-level

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (2)

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

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)