Skip to main content

Fundamental Problems at the Interface of Combinatorial Optimization with Integer Programming and Online Optimization

Searching for OpenAIRE data...

Publications

Reducing path TSP to TSP

Author(s): Vera Traub, Jens Vygen, Rico Zenklusen
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 14-27, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384256

A Better-Than-2 Approximation for Weighted Tree Augmentation

Author(s): Traub, Vera; Zenklusen, Rico
Published in: Proceedings of the IEEE Symposium on Foundations on Computer Science (FOCS), 2021, Page(s) 1-12
Publisher: IEEE

Congruency-Constrained TU Problems Beyond the Bimodular Case

Author(s): Martin Nägele, Richard Santiago, Rico Zenklusen
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 2743-2790
Publisher: ACM-SIAM
DOI: 10.1137/1.9781611977073.108

The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness

Author(s): Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Published in: Proceedings of the 52th ACM Symposium on Theory of Computing (STOC), 2020, Page(s) 1363-1374, ISBN 978-1-4503-6979-4
Publisher: ACM
DOI: 10.1145/3357713.3384286

Local Search for Weighted Tree Augmentation and Steiner Tree

Author(s): Vera Traub, Rico Zenklusen
Published in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Page(s) 3253-3272
Publisher: ACM-SIAM
DOI: 10.1137/1.9781611977073.128

Bridging the gap between tree and connectivity augmentation: unified and stronger approaches

Author(s): Federica Cecchetto; Vera Traub; Rico Zenklusen
Published in: Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC), 2021, Page(s) 370-383
Publisher: ACM
DOI: 10.1145/3406325.3451086

A new contraction technique with applications to congruency-constrained cuts

Author(s): Martin Nägele, Rico Zenklusen
Published in: Mathematical Programming, 183/1-2, 2020, Page(s) 455-481, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-020-01498-x

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems

Author(s): Moran Feldman, Ola Svensson, Rico Zenklusen
Published in: SIAM Journal on Computing, 50/2, 2021, Page(s) 255-300, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1226130

Simpler and Stronger Approaches for Non-Uniform Hypergraph Matching and the Füredi, Kahn, and Seymour Conjecture

Author(s): Georg Anegg, Haris Angelidakis, Rico Zenklusen
Published in: Symposium on Simplicity in Algorithms (SOSA), 2021, Page(s) 196-203, ISBN 978-1-61197-649-6
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976496.22

A Technique for Obtaining True Approximations for k-Center with Covering Constraints

Author(s): Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Published in: Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings, 12125, 2020, Page(s) 52-65, ISBN 978-3-030-45770-9
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-45771-6_5

Efficient Methods for Congruency-Constrained Optimization

Author(s): Nägele, Martin
Published in: 2021
Publisher: ETH Zurich
DOI: 10.3929/ethz-b-000518689