scientific article; zbMATH DE number 6381651

zbMATH Open1302.68208MaRDI QIDQ2934603FDOQ2934603

Authors: Spyros Angelopoulos 

Publication date: 18 December 2014

Title of this publication is not available (Why is that?)

Recommendations

• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• On the competitiveness of the online asymmetric and Euclidean Steiner tree problems
• scientific article; zbMATH DE number 1559550
• An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
• Online node-weighted Steiner tree and related problems
• Improved Steiner tree algorithms for bounded treewidth
• Improved Steiner tree algorithms for bounded treewidth
• Linear bounds for on-line Steiner problems
• An improved algorithm for the Steiner tree problem with bounded edge-length
• Non-greedy online Steiner trees on outerplanar graphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12)

Cited In (6)

• Parameterized analysis of the online priority and node-weighted Steiner tree problems
• THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
• The Bursty Steiner Tree Problem
• A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
• Online Priority Steiner Tree Problems
• On the competitiveness of the online asymmetric and Euclidean Steiner tree problems

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 Q2934603)