scientific article; zbMATH DE number 7376079
From MaRDI portal
Publication:5002841
DOI10.4230/LIPIcs.ICALP.2018.152zbMath1499.68410MaRDI QIDQ5002841
Sina Dehghani, Saeed Seddighin, Soheil Ehsani, Vahid Liaghat, Mohammad Taghi Hajiaghayi
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Online algorithms; streaming algorithms (68W27)
Related Items (4)
Bounded Degree Group Steiner Tree Problems ⋮ Tight bounds for online weighted tree augmentation ⋮ On approximating degree-bounded network design problems ⋮ Tight Bounds for Online Weighted Tree Augmentation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A factor 2 approximation algorithm for the generalized Steiner network problem
- Edge-disjoint trees containing some given vertices in a graph
- On-line generalized Steiner problem
- A primal-dual approximation algorithm for generalized Steiner network problems
- Hardness and approximation results for packing Steiner trees
- An O(logn)-Competitive Algorithm for Online Constrained Forest Problems
- Randomized metarounding (extended abstract)
- Edge-Disjoint Spanning Trees of Finite Graphs
- The Online Set Cover Problem
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Dynamic Steiner Tree Problem
- A General Approximation Technique for Constrained Forest Problems
- Online and Stochastic Survivable Network Design
- Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems
- Online Node-Weighted Steiner Tree and Related Problems
This page was built for publication:
