28 citations · 73 across the 23 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
Online Steiner Tree with Deletions
Anupam Gupta, Amit Kumar
In the online Steiner tree problem, the input is a set of vertices that appear one-by-one, and we have to maintain a Steiner tree on the current set of vertices. The cost of the tr…
cs.DS2013★ 3 cited
The Power of Deferral: Maintaining a Constant-Competitive Steiner Tree Online
Albert Gu, Anupam Gupta, Amit Kumar
In the online Steiner tree problem, a sequence of points is revealed one-by-one: when a point arrives, we only have time to add a single edge connecting this point to the previous…