The bursty Steiner tree problem

DOI10.1142/S0129054117500290MaRDI QIDQ4639923zbMATH OpenOpenAlexWikidataFDO

Authors Gokarna Sharma, Costas Busch

Publication date 14 May 2018

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054117500290

zbMATH Keywords

approximationonline executionSteiner treeterminal burststerminal Steiner tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Recommendations

• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• scientific article; zbMATH DE number 6381651
• scientific article; zbMATH DE number 1559550
• Online Priority Steiner Tree Problems
• On the competitiveness of the online asymmetric and Euclidean Steiner tree problems

Cites work

• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• Bounds for Certain Multiprocessing Anomalies
• Dynamic Steiner Tree Problem
• scientific article; zbMATH DE number 6381651 (Why is no real title available?)
• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Linear bounds for on-line Steiner problems
• On the competitiveness of the online asymmetric and Euclidean Steiner tree problems
• On the terminal Steiner tree problem.
• Online node-weighted Steiner tree and related problems
• Online Scheduling with Lookahead: Multipass Assembly Lines
• Steiner tree approximation via iterative randomized rounding
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
• The full Steiner tree problem
• The node-weighted steiner tree problem
• The Steiner problem with edge lengths 1 and 2

Cited in

(2)

• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• An approximation algorithm for generalized connectivity problem on planar graphs

This page was built for publication: The bursty Steiner tree problem

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