Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
433887 | Theoretical Computer Science | 2015 | 11 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Guy Even, Moti Medina,