Christine Markarian
ABSTRACT
Many markets have seen a shift from the idea of buying and moved to leasing instead. Arguably, the latter has been the major catalyst for their success. Ten years ago, research realized this shift and initiated the study of 'online leasing problems' by introducing leasing to online optimization problems. Resources required to provide a service in an 'online leasing problem' are no more bought but leased for different durations. In this paper, we provide an overview of results that contribute to the understanding of 'online resource leasing problems'.
- . Meyerson The parking permit problem. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 274 - 284, 2005. Google Scholar
Digital Library
- . Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor The online set cover problem. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computation (STOC), pp. 100 - 105, 2003. Google ScholarDigital Library
- . Andrews and L. Zhang Wavelength assignment in optical networks with fixed fiber capacity. In Proceedings of the 31st International Colloquium (ICALP), pp. 134 - 145, 2004.Google Scholar
- . Gupta, A. Kumar, M. P'al, and Roughgarden Approximation via cost sharing: Simpler and better approximation algorithms for network design. Journal of the ACM (JACM) 54 (3), No. 11, 2007. Google ScholarDigital Library
- . Fotakis A primal-dual algorithm for online non-uniform facility location. Journal of Discrete Algorithms, 5 (1), pp. 141 - 148, 2007. Google ScholarDigital Library
- . Fotakis On the competitive ratio for online facility location. Algorithmica, 50 (1), pp. 1 - 57, 2008. Google ScholarDigital Library
- . Meyerson Online facility location. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 426 - 431, 2001. Google ScholarDigital Library
- . M. Anthony and A. Gupta Infrastructure leasing problems. In Proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 424 - 438, 2007. Google ScholarDigital Library
- . Nagarajan and D. Williamson Offline and online facility leasing. In Proceedings of the 13th International Conference on Integer Programming and Combinatorial Optimization (IPCO), 5035, pp. 303 - 315, 2008. Google ScholarDigital Library
- . Kling, F. Meyer auf der Heide, and P. Pietrzyk An Algorithm for online facility leasing. In Proceedings of the 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 61 - 72, 2012. Google ScholarDigital Library
- . Li, A. Macker, C. Markarian, F. Meyer auf der Heide, and Sören Riechers Towards flexible demands in pnline leasing problems. In 21st International Computing and Combinatorics Conference (COCOON), to appear, 2015.Google Scholar
- . Abshoff, C. Markarian, and F. Meyer auf der Heide Randomized Online algorithms for set cover leasing problems. In Proceedings of the 8th Annual International Conference on Combinatorial Optimization and Applications (COCOA), pp 25 - 34, 2014.Google ScholarDigital Library
Index Terms
- Online Resource Leasing
Recommendations
Price Fluctuation in Online Leasing
Combinatorial Optimization and ApplicationsAbstractCurrent theoretical attempts towards understanding real-life leasing scenarios assume the following leasing model. Demands arrive with time and need to be served by leased resources. Different types of leases are available, each with a fixed ...
Towards Flexible Demands in Online Leasing Problems
We consider online leasing problems in which demands arrive over time and need to be served by leasing resources. We introduce a new model for these problems in which a resource can be leased for K different durations each incurring a different cost (...
Randomized Online Algorithms for Set Cover Leasing Problems
Combinatorial Optimization and ApplicationsAbstractIn the leasing variant of Set Cover presented by Anthony et al. [1], elements arrive over time and must be covered by sets from a family of subsets of . Each set can be leased for different periods of time. Let and . Leasing a set for a ...
Comments