Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Alice Paul, Daniel Freund, Aaron Ferber, David B. Shmoys, and David P. Williamson. Prize-Collecting TSP with a Budget Constraint. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{paul_et_al:LIPIcs.ESA.2017.62, author = {Paul, Alice and Freund, Daniel and Ferber, Aaron and Shmoys, David B. and Williamson, David P.}, title = {{Prize-Collecting TSP with a Budget Constraint}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-049-1}, ISSN = {1868-8969}, year = {2017}, volume = {87}, editor = {Pruhs, Kirk and Sohler, Christian}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2017.62}, URN = {urn:nbn:de:0030-drops-78375}, doi = {10.4230/LIPIcs.ESA.2017.62}, annote = {Keywords: approximation algorithms, traveling salesman problem} }
Published in: Dagstuhl Reports, Volume 13, Issue 2 (2023)
Nicole Megow, Benjamin J. Moseley, David Shmoys, Ola Svensson, Sergei Vassilvitskii, and Jens Schlöter. Scheduling (Dagstuhl Seminar 23061). In Dagstuhl Reports, Volume 13, Issue 2, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{megow_et_al:DagRep.13.2.1, author = {Megow, Nicole and Moseley, Benjamin J. and Shmoys, David and Svensson, Ola and Vassilvitskii, Sergei and Schl\"{o}ter, Jens}, title = {{Scheduling (Dagstuhl Seminar 23061)}}, pages = {1--19}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {13}, number = {2}, editor = {Megow, Nicole and Moseley, Benjamin J. and Shmoys, David and Svensson, Ola and Vassilvitskii, Sergei and Schl\"{o}ter, Jens}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.13.2.1}, URN = {urn:nbn:de:0030-drops-191789}, doi = {10.4230/DagRep.13.2.1}, annote = {Keywords: scheduling, mathematical optimization, approximation algorithms, learning methods, uncertainty} }
Published in: Dagstuhl Reports, Volume 10, Issue 2 (2020)
Nicole Megow, David Shmoys, and Ola Svensson. Scheduling (Dagstuhl Seminar 20081). In Dagstuhl Reports, Volume 10, Issue 2, pp. 50-75, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@Article{megow_et_al:DagRep.10.2.50, author = {Megow, Nicole and Shmoys, David and Svensson, Ola}, title = {{Scheduling (Dagstuhl Seminar 20081)}}, pages = {50--75}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2020}, volume = {10}, number = {2}, editor = {Megow, Nicole and Shmoys, David and Svensson, Ola}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.10.2.50}, URN = {urn:nbn:de:0030-drops-130590}, doi = {10.4230/DagRep.10.2.50}, annote = {Keywords: scheduling, optimization, approximation algorithms, routing, transportation, mechanism design} }
Published in: Dagstuhl Seminar Proceedings, Volume 7391, Probabilistic Methods in the Design and Analysis of Algorithms (2007)
Chaitanya Swamy and David Shmoys. Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization. In Probabilistic Methods in the Design and Analysis of Algorithms. Dagstuhl Seminar Proceedings, Volume 7391, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{swamy_et_al:DagSemProc.07391.2, author = {Swamy, Chaitanya and Shmoys, David}, title = {{Sampling-based Approximation Algorithms for Multi-stage Stochastic Optimization}}, booktitle = {Probabilistic Methods in the Design and Analysis of Algorithms}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {7391}, editor = {Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V\"{o}cking}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07391.2}, URN = {urn:nbn:de:0030-drops-12906}, doi = {10.4230/DagSemProc.07391.2}, annote = {Keywords: Stochastic optimization, approximation algorithms, randomized algorithms, linear programming} }
Published in: Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)
Chaitanya Swamy and David Shmoys. Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization. In Algorithms for Optimization with Incomplete Information. Dagstuhl Seminar Proceedings, Volume 5031, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{swamy_et_al:DagSemProc.05031.5, author = {Swamy, Chaitanya and Shmoys, David}, title = {{Approximation Algorithms for 2-stage and Multi-stage Stochastic Optimization}}, booktitle = {Algorithms for Optimization with Incomplete Information}, pages = {1--5}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5031}, editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.5}, URN = {urn:nbn:de:0030-drops-723}, doi = {10.4230/DagSemProc.05031.5}, annote = {Keywords: Algorithms, Approximation Algorithms, Optimization, Convex Optimization, Stochastic Optimization} }
Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)
Yuval Rabani, David Shmoys, and Gerhard Woeginger. Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734). Dagstuhl Seminar Report 187, pp. 1-33, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1998)
@TechReport{rabani_et_al:DagSemRep.187, author = {Rabani, Yuval and Shmoys, David and Woeginger, Gerhard}, title = {{Combinatorial Approximation Algorithms (Dagstuhl Seminar 9734)}}, pages = {1--33}, ISSN = {1619-0203}, year = {1998}, type = {Dagstuhl Seminar Report}, number = {187}, institution = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.187}, URN = {urn:nbn:de:0030-drops-150746}, doi = {10.4230/DagSemRep.187}, }
Feedback for Dagstuhl Publishing