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.
Original language | English |
---|---|
Pages (from-to) | 144-154 |
Number of pages | 11 |
Journal | Theoretical Computer Science |
Volume | 584 |
DOIs | |
State | Published - 13 Jun 2015 |
Externally published | Yes |
Keywords
- Nonmonotone analysis
- Online algorithms
- Primal-dual approach
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science