24 citations · 28 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
Online Weighted Degree-Bounded Steiner Networks via Novel Online Mixed Packing/Covering
Sina Dehghani, Soheil Ehsani, MohammadTaghi Hajiaghayi +3
We design the first online algorithm with poly-logarithmic competitive ratio for the edge-weighted degree-bounded Steiner forest(EW-DB-SF) problem and its generalized variant. We o…
cs.DS2017
Online Degree-Bounded Steiner Network Design
Sina Dahghani, Soheil Ehsani, MohammadTaghi Hajiaghayi +2
We initiate the study of degree-bounded network design problems in the online setting. The degree-bounded Steiner tree problem { which asks for a subgraph with minimum degree that…