Published in: OASIcs, Volume 65, 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)
Irving van Heuven van Staereling. Tree Decomposition Methods for the Periodic Event Scheduling Problem. In 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018). Open Access Series in Informatics (OASIcs), Volume 65, pp. 6:1-6:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{vanheuvenvanstaereling:OASIcs.ATMOS.2018.6, author = {van Heuven van Staereling, Irving}, title = {{Tree Decomposition Methods for the Periodic Event Scheduling Problem}}, booktitle = {18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018)}, pages = {6:1--6:13}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-95977-096-5}, ISSN = {2190-6807}, year = {2018}, volume = {65}, editor = {Bornd\"{o}rfer, Ralf and Storandt, Sabine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2018.6}, URN = {urn:nbn:de:0030-drops-97112}, doi = {10.4230/OASIcs.ATMOS.2018.6}, annote = {Keywords: Dynamic Programming, Trees, Periodic Event Scheduling Problem} }
Published in: LIPIcs, Volume 58, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)
Irving van Heuven van Staereling, Bart de Keijzer, and Guido Schäfer. The Ground-Set-Cost Budgeted Maximum Coverage Problem. In 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 58, pp. 50:1-50:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{vanheuvenvanstaereling_et_al:LIPIcs.MFCS.2016.50, author = {van Heuven van Staereling, Irving and de Keijzer, Bart and Sch\"{a}fer, Guido}, title = {{The Ground-Set-Cost Budgeted Maximum Coverage Problem}}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)}, pages = {50:1--50:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-016-3}, ISSN = {1868-8969}, year = {2016}, volume = {58}, editor = {Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.50}, URN = {urn:nbn:de:0030-drops-65020}, doi = {10.4230/LIPIcs.MFCS.2016.50}, annote = {Keywords: maximum coverage problem, approximation algorithms, hypergraphs, submodular optimization, sponsored search} }
Feedback for Dagstuhl Publishing