Autor:	Even, Guy, Medina, Moti
Rok vydání:	2013
Předmět:	Computer Science - Data Structures and Algorithms
Druh dokumentu:	Working Paper
Popis:	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. Comment: To appear in SIROCCO 2013
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1304.7687 Zobrazit plný text záznamu View this record from Arxiv