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. [1] for routing virtual circuits with unknown durations.
The full version of this paper can be found in http://arxiv.org/abs/1304.7687 .
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-319-03578-9_29
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Awerbuch, B., Azar, Y., Plotkin, S., Waarts, O.: Competitive routing of virtual circuits with unknown duration. Journal of Computer and System Sciences 62(3), 385–397 (2001)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: FOCS 1993: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, pp. 32–40. IEEE Computer Society, Washington, DC (1993)
Azar, Y., Kalyanasundaram, B., Plotkin, S., Pruhs, K.R., Waarts, O.: On-line load balancing of temporary tasks. Journal of Algorithms 22(1), 93–110 (1997)
Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM (JACM) 44(3), 486–504 (1997)
Buchbinder, N., Naor, J.S.: The design of competitive online algorithms via a primal-dual approach. Foundations and Trends in Theoretical Computer Science 3(2-3), 99–263 (2009)
Buchbinder, N., Feldman, M., Ghosh, A., Naor, J(S.): Frequency capping in online advertising. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 147–158. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Even, G., Medina, M. (2013). A Nonmonotone Analysis with the Primal-Dual Approach: Online Routing of Virtual Circuits with Unknown Durations. In: Moscibroda, T., Rescigno, A.A. (eds) Structural Information and Communication Complexity. SIROCCO 2013. Lecture Notes in Computer Science, vol 8179. Springer, Cham. https://doi.org/10.1007/978-3-319-03578-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-03578-9_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03577-2
Online ISBN: 978-3-319-03578-9
eBook Packages: Computer ScienceComputer Science (R0)