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

DOI10.1007/978-3-030-80879-2_13OpenAlexW3184075718MaRDI QIDQ2117699

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

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

Related Items (1)

On the complexity of the cable-trench problem

Cites Work

• Unnamed Item
• Faster min-max resource sharing in theory and practice
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• Balancing minimum spanning trees and shortest-path trees
• Cost-Distance: Two Metric Network Design
• Network Design via Core Detouring for Problems without a Core
• A Constant Factor Approximation for the Single Sink Edge Installation Problem
• Shallow-Light Steiner Arborescences with Vertex Delays
• On the approximability of some network design problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• Steiner Tree Approximation via Iterative Randomized Rounding
• A faster approximation algorithm for the Steiner problem in graphs

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