A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Online Priority Steiner Tree Problems
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the competitiveness of the online asymmetric and euclidean steiner tree problems
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Hi-index | 0.89 |