An improved approximation algorithm for the uniform cost-distance Steiner tree problem

DOI10.1007/978-3-030-80879-2_13MaRDI QIDQ2117699zbMATH OpenOpenAlexFDO

Authors Ardalan Khazraei, Stephan Held

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-80879-2_13

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Approximation algorithms (68W25)

Cites work

• scientific article; zbMATH DE number 2086941 (Why is no real title available?)
• A constant factor approximation for the single sink edge installation problem
• A faster approximation algorithm for the Steiner problem in graphs
• Balancing minimum spanning trees and shortest-path trees
• Cost-Distance: Two Metric Network Design
• Faster min-max resource sharing in theory and practice
• Fibonacci heaps and their uses in improved network optimization algorithms
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• Network design via core detouring for problems without a core
• On the approximability of some network design problems
• Shallow-light Steiner arborescences with vertex delays
• Steiner tree approximation via iterative randomized rounding

Cited in

(3)

• On the complexity of the cable-trench problem
• An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2
• Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights

This page was built for publication: An improved approximation algorithm for the uniform cost-distance Steiner tree problem

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