Tight Approximation Algorithms for Ordered Covering. Batra, J., Das, S., & Jha, A. V. In Morin, P. & Suri, S., editors, Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings, volume 14079, of Lecture Notes in Computer Science, pages 120–135, 2023. Springer.
Tight Approximation Algorithms for Ordered Covering [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/wads/BatraDJ23,
  author       = {Jatin Batra and
                  Syamantak Das and
                  Agastya Vibhuti Jha},
  editor       = {Pat Morin and
                  Subhash Suri},
  title        = {Tight Approximation Algorithms for Ordered Covering},
  booktitle    = {Algorithms and Data Structures - 18th International Symposium, {WADS}
                  2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {14079},
  pages        = {120--135},
  publisher    = {Springer},
  year         = {2023},
  url          = {https://doi.org/10.1007/978-3-031-38906-1\_9},
  doi          = {10.1007/978-3-031-38906-1\_9},
  timestamp    = {Tue, 01 Aug 2023 13:49:25 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BatraDJ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

Downloads: 0