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

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

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

• Fibonacci heaps and their uses in improved network optimization algorithms
• Steiner Tree Approximation via Iterative Randomized Rounding
• 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
• Title not available (Why is that?)
• A faster approximation algorithm for the Steiner problem in graphs
• Shallow-Light Steiner Arborescences with Vertex Delays
• Faster min-max resource sharing in theory and practice
• Balancing minimum spanning trees and shortest-path trees
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
• On the approximability of some network design problems

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)