Skip to main content
SpringerLink
Log in

An Online Variant of Set Cover Inspired by Happy Clients

  • Conference paper
  • First Online:
Innovative Intelligent Industrial Production and Logistics (IN4PL 2020, IN4PL 2021)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1855))

  • 68 Accesses

Abstract

Over the past decades, the concept of leasing has been widely spread in many industries. Companies have been leasing their resources rather than buying them. Small businesses were now able to join the markets without the need for upfront costs. Companies were now able to get access to the most up-to-date equipments with significantly lower costs. Despite its popularity, leasing was first introduced as a theoretical model in 2005. Following this model, many well-known optimization problems were studied in the leasing setting. This paper is devoted to continuing the algorithmic study on leasing in the context of the well-known Set Cover problem (SC). SC is one of the most well-studied NP-hard optimization problems in combinatorics, operations research, and computer science, appearing as sub-problems in many real-world applications. In this paper, we conduct a study from an online algorithmic perspective. That is, unlike the classical offline setting in which the entire input sequence is given to the algorithm all at once, the input sequence is given to the online algorithm in portions over time. In particular, we study an online leasing variant of Set Cover, known as the Online Set Cover Leasing with Happiness Costs problem (Leasing OSC-HC). We design the first online algorithm for Leasing OSC-HC and analyze its performance in the competitive analysis framework in which the online algorithm is evaluated against the optimal offline solution over all possible instances of a given problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Abshoff, S., Kling, P., Markarian, C., Meyerauf der Heide, F., Pietrzyk, P.: Towards the price of leasing online. J. Comb. Optim. 32(4), 1197–1216 (2016)

    Google Scholar 

  2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The online set cover problem. SIAM J. Comput. 39(2), 361–370 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alon, N., Azar, Y., Gutner, S.: Admission control to minimize rejections and online set cover with repetitions. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 238–244 (2005)

    Google Scholar 

  4. Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 424–438. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72792-7_32

    Chapter  Google Scholar 

  5. Bhawalkar, K., Gollapudi, S., Panigrahi, D.: Online set cover with set requests. In: Klaus J., Rolim, J.D.P., Devanur, N.R., Moore, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014), vol. 28 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 64–79. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014)

    Google Scholar 

  6. Bienkowski, M., Kraska, A., Schmidt, P.: A deterministic algorithm for online steiner tree leasing. In: WADS 2017. LNCS, vol. 10389, pp. 169–180. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62127-2_15

    Chapter  Google Scholar 

  7. Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270–286 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  8. Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353–371 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  9. Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634–652 (1998)

    Article  MATH  Google Scholar 

  10. Feige, U., Lovász, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219–234 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  11. Feldkord, B., Markarian, C., Meyer Auf der Heide, F.: Price fluctuation in online leasing. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 17–31. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-71147-8_2

    Chapter  Google Scholar 

  12. Korman, S.: On the use of randomization in the online set cover problem. Weizmann Inst. Sci. 2 (2004)

    Google Scholar 

  13. Li, S., Markarian, C., auf der Heide, F.M.: Towards flexible demands in online leasing problems. Algorithmica 80(5), 1556–1574 (2018)

    Google Scholar 

  14. Markarian, C.: Leasing with uncertainty. In: Kliewer, N., Ehmke, J.F., Borndörfer, R. (eds.) Operations Research Proceedings 2017. ORP, pp. 429–434. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-89920-6_57

    Chapter  Google Scholar 

  15. Markarian, C.: Online non-metric facility location with service installation costs. In: Filipe, J., Smialek, M., Brodsky, A., Hammoudi, S. (eds.) Proceedings of the 23rd International Conference on Enterprise Information Systems, ICEIS 2021, Online Streaming, 26–28 April 2021, vol. 1, pp. 737–743. SCITEPRESS (2021)

    Google Scholar 

  16. Markarian, C.: Online set cover with happiness costs. In: Panetto, H., Macchi, M., Madani, K. (eds.) Proceedings of the 2nd International Conference on Innovative Intelligent Industrial Production and Logistics, IN4PL 2021, 25–27 October 2021, pp. 40–45. SCITEPRESS (2021)

    Google Scholar 

  17. Markarian, C., auf der Heide, F.M.: Online algorithms for leasing vertex cover and leasing non-metric facility location. In: Parlier, G.H., Liberatore, F., Demange, M. (eds.) Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, Prague, Czech Republic, 19–21 February 2019, pp. 315–321. SciTePress (2019)

    Google Scholar 

  18. Markarian, C., Kassar, A.-N.: Online deterministic algorithms for connected dominating set & set cover leasing problems. In: ICORES, pp. 121–128 (2020)

    Google Scholar 

  19. Markarian, C., Khallouf, P.: Online facility service leasing inspired by the covid-19 pandemic. In: 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021, pp. 195–202 (2021)

    Google Scholar 

  20. Markarian, C., Khallouf, P.: Online facility service leasing inspired by the COVID-19 pandemic. In: Gusikhin, O., Nijmeijer, H., Madani, K. (eds.) Proceedings of the 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021, Online Streaming, 6–8 July 2021, pp. 195–202. SCITEPRESS (2021)

    Google Scholar 

  21. Meyerson, A.: The parking permit problem. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 274–282. IEEE (2005)

    Google Scholar 

  22. Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Disc. Optim. 10(4), 361–370 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  23. de Lima, M.S., San Felice, M.C., Lee, O.: Connected facility leasing problems. In: ICTCS/CILC, pp. 162–173 (2017)

    Google Scholar 

  24. de Lima, M.S., San Felice, M.C., Lee, O.: On generalizations of the parking permit problem and network leasing problems. Electron. Notes Disc. Math. 62, 225–230 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  25. Slavık, P.: A tight analysis of the greedy algorithm for set cover. J. Algor. 25(2), 237–254 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  26. Vemuganti, R.R.: Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey, pp. 573–746. Springer, Boston (1998). https://doi.org/10.1007/978-1-4613-0303-9_9

Download references

Author information

Authors and Affiliations

  1. Department of Engineering and Information Technology, University of Dubai, Dubai, UAE

    Christine Markarian

Authors
  1. Christine Markarian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christine Markarian .

Editor information

Editors and Affiliations

  1. Russian Academy of Sciences, St. Petersburg, Russia

    Alexander Smirnov

  2. University of Lorraine, Nancy, France

    Hervé Panetto

  3. University of Paris-EST Créteil, Créteil, France

    Kurosh Madani

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Markarian, C. (2023). An Online Variant of Set Cover Inspired by Happy Clients. In: Smirnov, A., Panetto, H., Madani, K. (eds) Innovative Intelligent Industrial Production and Logistics. IN4PL IN4PL 2020 2021. Communications in Computer and Information Science, vol 1855. Springer, Cham. https://doi.org/10.1007/978-3-031-37228-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-37228-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-37227-8

  • Online ISBN: 978-3-031-37228-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation