A Nonmonotone Analysis with the Primal-Dual Approach: online routing of virtual circuits with unknown durations

TL;DR

This paper demonstrates that the primal-dual approach can be effectively applied to nonmonotone online problems, specifically for routing virtual circuits with unknown durations, expanding the applicability of this analytical method.

Contribution

It introduces a primal-dual analysis framework for nonmonotone online algorithms, applied to virtual circuit routing with unknown durations, which was previously unaddressed.

Findings

Primal-dual approach is applicable to nonmonotone online problems.

The analysis is applied to routing virtual circuits with unknown durations.

The method extends primal-dual techniques to new problem classes.

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.[AAPW01] for routing virtual circuits with unknown durations.