Preemptive and Non-Preemptive Generalized Min Sum Set Cover

Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan. Preemptive and Non-Preemptive Generalized Min Sum Set Cover. In Christoph Dürr, Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France. Volume 14 of LIPIcs, pages 465-476, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2012. [doi]

@inproceedings{ImSZ12,
  title = {Preemptive and Non-Preemptive Generalized Min Sum Set Cover},
  author = {Sungjin Im and Maxim Sviridenko and Ruben van der Zwaan},
  year = {2012},
  doi = {10.4230/LIPIcs.STACS.2012.465},
  url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2012.465},
  researchr = {https://researchr.org/publication/ImSZ12},
  cites = {0},
  citedby = {0},
  pages = {465-476},
  booktitle = {29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France},
  editor = {Christoph Dürr and Thomas Wilke},
  volume = {14},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-35-4},
}