Go to the corresponding LIPIcs Volume Portal 
Fotakis, Dimitris ; Kostopanagiotis, Panagiotis ; Nakos, Vasileios ; Piliouras, Georgios ; Skoulakis, Stratis
pdfformat: 

@InProceedings{fotakis_et_al:LIPIcs.ICALP.2021.65, author = {Fotakis, Dimitris and Kostopanagiotis, Panagiotis and Nakos, Vasileios and Piliouras, Georgios and Skoulakis, Stratis}, title = {{On the Approximability of Multistage MinSum Set Cover}}, booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)}, pages = {65:165:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771955}, ISSN = {18688969}, year = {2021}, volume = {198}, editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14134}, URN = {urn:nbn:de:0030drops141341}, doi = {10.4230/LIPIcs.ICALP.2021.65}, annote = {Keywords: Approximation Algorithms, Multistage MinSum Set Cover, Multistage Optimization Problems} }
Keywords:  Approximation Algorithms, Multistage MinSum Set Cover, Multistage Optimization Problems  
Collection:  48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)  
Issue Date:  2021  
Date of publication:  02.07.2021 