摘要

We address the question of whether the primal-dual approach for the design and analysis of online algorithms can be applied to nonmonotone problems. We provide a positive answer by presenting a primal-dual analysis to the online algorithm of Awerbuch et al. [3] for routing virtual circuits with unknown durations.

  • 出版日期2015-6-13

全文