LIPIcs, Volume 207
APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, US (Virtual Conference)
Editors: Mary Wootters and Laura Sanità
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Dylan Hyatt-Denesik, Afrouz Jabal Ameli, and Laura Sanità. Finding Almost Tight Witness Trees. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 79:1-79:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{hyattdenesik_et_al:LIPIcs.ICALP.2023.79, author = {Hyatt-Denesik, Dylan and Jabal Ameli, Afrouz and Sanit\`{a}, Laura}, title = {{Finding Almost Tight Witness Trees}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {79:1--79:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.79}, URN = {urn:nbn:de:0030-drops-181314}, doi = {10.4230/LIPIcs.ICALP.2023.79}, annote = {Keywords: Algorithms, Network Design, Approximation} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Mary Wootters and Laura Sanità. LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 1-1240, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@Proceedings{wootters_et_al:LIPIcs.APPROX/RANDOM.2021, title = {{LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {1--1240}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021}, URN = {urn:nbn:de:0030-drops-146929}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021}, annote = {Keywords: LIPIcs, Volume 207, APPROX/RANDOM 2021, Complete Volume} }
Published in: LIPIcs, Volume 207, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)
Mary Wootters and Laura Sanità. Front Matter, Table of Contents, Preface, Conference Organization. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 0:i-0:x, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{wootters_et_al:LIPIcs.APPROX/RANDOM.2021.0, author = {Wootters, Mary and Sanit\`{a}, Laura}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021)}, pages = {0:i--0:x}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-207-5}, ISSN = {1868-8969}, year = {2021}, volume = {207}, editor = {Wootters, Mary and Sanit\`{a}, Laura}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.0}, URN = {urn:nbn:de:0030-drops-146933}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 112, 26th Annual European Symposium on Algorithms (ESA 2018)
Sara Ahmadian, Umang Bhaskar, Laura Sanità, and Chaitanya Swamy. Algorithms for Inverse Optimization Problems. In 26th Annual European Symposium on Algorithms (ESA 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 112, pp. 1:1-1:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{ahmadian_et_al:LIPIcs.ESA.2018.1, author = {Ahmadian, Sara and Bhaskar, Umang and Sanit\`{a}, Laura and Swamy, Chaitanya}, title = {{Algorithms for Inverse Optimization Problems}}, booktitle = {26th Annual European Symposium on Algorithms (ESA 2018)}, pages = {1:1--1:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-081-1}, ISSN = {1868-8969}, year = {2018}, volume = {112}, editor = {Azar, Yossi and Bast, Hannah and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.1}, URN = {urn:nbn:de:0030-drops-94646}, doi = {10.4230/LIPIcs.ESA.2018.1}, annote = {Keywords: Inverse optimization, Shortest paths, Approximation algorithms, Linear programming, Polyhedral theory, Combinatorial optimization} }
Published in: LIPIcs, Volume 107, 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Zhuan Khye Koh and Laura Sanità. Stabilizing Weighted Graphs. In 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 107, pp. 83:1-83:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{koh_et_al:LIPIcs.ICALP.2018.83, author = {Koh, Zhuan Khye and Sanit\`{a}, Laura}, title = {{Stabilizing Weighted Graphs}}, booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)}, pages = {83:1--83:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-076-7}, ISSN = {1868-8969}, year = {2018}, volume = {107}, editor = {Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, D\'{a}niel and Sannella, Donald}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2018.83}, URN = {urn:nbn:de:0030-drops-90877}, doi = {10.4230/LIPIcs.ICALP.2018.83}, annote = {Keywords: combinatorial optimization, network bargaining, cooperative game} }
Published in: LIPIcs, Volume 87, 25th Annual European Symposium on Algorithms (ESA 2017)
Guru Guruganesh, Jennifer Iglesias, R. Ravi, and Laura Sanita. Single-Sink Fractionally Subadditive Network Design. In 25th Annual European Symposium on Algorithms (ESA 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 87, pp. 46:1-46:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{guruganesh_et_al:LIPIcs.ESA.2017.46, author = {Guruganesh, Guru and Iglesias, Jennifer and Ravi, R. and Sanita, Laura}, title = {{Single-Sink Fractionally Subadditive Network Design}}, booktitle = {25th Annual European Symposium on Algorithms (ESA 2017)}, pages = {46:1--46:13}, 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.46}, URN = {urn:nbn:de:0030-drops-78581}, doi = {10.4230/LIPIcs.ESA.2017.46}, annote = {Keywords: Network design, single-commodity flow, approximation algorithms, Steiner tree} }
Published in: LIPIcs, Volume 64, 27th International Symposium on Algorithms and Computation (ISAAC 2016)
Andreas Emil Feldmann, Jochen Könemann, Kanstantsin Pashkovich, and Laura Sanità. Fast Approximation Algorithms for the Generalized Survivable Network Design Problem. In 27th International Symposium on Algorithms and Computation (ISAAC 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 64, pp. 33:1-33:12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
@InProceedings{feldmann_et_al:LIPIcs.ISAAC.2016.33, author = {Feldmann, Andreas Emil and K\"{o}nemann, Jochen and Pashkovich, Kanstantsin and Sanit\`{a}, Laura}, title = {{Fast Approximation Algorithms for the Generalized Survivable Network Design Problem}}, booktitle = {27th International Symposium on Algorithms and Computation (ISAAC 2016)}, pages = {33:1--33:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-026-2}, ISSN = {1868-8969}, year = {2016}, volume = {64}, editor = {Hong, Seok-Hee}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.33}, URN = {urn:nbn:de:0030-drops-68035}, doi = {10.4230/LIPIcs.ISAAC.2016.33}, annote = {Keywords: strongly polynomial runtime, generalized survivable network design, primal-dual method} }
Published in: LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)
Andreas Emil Feldmann, Jochen Könemann, Neil Olver, and Laura Sanità. On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 176-191, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2014)
@InProceedings{feldmann_et_al:LIPIcs.APPROX-RANDOM.2014.176, author = {Feldmann, Andreas Emil and K\"{o}nemann, Jochen and Olver, Neil and Sanit\`{a}, Laura}, title = {{On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)}, pages = {176--191}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-74-3}, ISSN = {1868-8969}, year = {2014}, volume = {28}, editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.176}, URN = {urn:nbn:de:0030-drops-46962}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.176}, annote = {Keywords: Steiner tree, bidirected cut relaxation, hypergraphic relaxation, polyhedral equivalence, approximation algorithms} }
Feedback for Dagstuhl Publishing