Online Node-Weighted Steiner Forest and Extensions via Disk Paintings


We give the first polynomial-time online algorithm for the node-weighted Steiner forest problem with a poly-logarithmic competitive ratio. The competitive ratio of our algorithm is optimal up to a logarithmic factor. For the special case of graphs with an excluded fixed minor (e.g., planar graphs), we obtain a logarithmic competitive ratio, which is optimal… (More)
DOI: 10.1109/FOCS.2013.66


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.


Citations per Year

Citation Velocity: 7

Averaging 7 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics