Parameterized Analysis of Online Steiner Tree Problems

Abstract

Steiner tree problems occupy a central place in both areas of approximation and on-line algorithms. Many variants have been studied from the point of view of competitive analysis, and for several of these variants tight bounds are known. However, in several cases, worst-case analysis is overly pessimistic, and fails to explain the relative performance of… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics