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

Project Information

ICOPT

Grant agreement ID: 817750

DOI

10.3030/817750

Project closed

EC signature date 17 January 2019

Start date 1 November 2019

End date 31 October 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 443 422,00

EU contribution

€ 1 443 422,00

Coordinated by

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (18)

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

Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information

Author(s): Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Published in: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Page(s) 84-95
Publisher: SIAM
DOI: 10.1137/1.9781611977585.ch8

Fair and Fast k-Center Clustering for Data Summarization

Author(s): Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
Published in: Proceedings of the 39th International Conference on Machine Learning (ICML), 2022, Page(s) 162:669-702
Publisher: PMLR

Complexity of Polytope Diameters via Perfect Matchings

Author(s): Christian Nöbel, Raphael Steiner
Published in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2025
Publisher: ACM-SIAM

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

Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid

Author(s): Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Published in: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2023, Page(s) 423-437
Publisher: Springer
DOI: 10.1007/978-3-031-32726-1_30

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

A Simple Combinatorial Algorithm for Robust Matroid Center

Author(s): Anegg, Georg; Koch, Laura Vargas; Zenklusen, Rico
Published in: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Page(s) 96-102
Publisher: SIAM
DOI: 10.1137/1.9781611977585.ch9

Techniques for Generalized Colorful $k$-Center Problems

Author(s): Anegg, Georg; Vargas Koch, Laura; Zenklusen, Rico
Published in: Proceedings of the 30th Annual European Symposium on Algorithms (ESA), 2022, Page(s) 7:1-7:14
Publisher: Dagstuhl Publishing
DOI: 10.48550/arxiv.2207.02609

A (1.5+ε)-Approximation Algorithm for Weighted Connectivity Augmentation

Author(s): Traub, Vera; Zenklusen, Rico
Published in: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Page(s) 1820-1833
Publisher: ACM
DOI: 10.1145/3564246.3585122

Single-Source Unsplittable Flows in Planar Graphs

Author(s): Traub, Vera; Koch, Laura Vargas; Zenklusen, Rico
Published in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Publisher: SIAM
DOI: 10.1137/1.9781611977912.24

Streaming Submodular Maximization Under Matroid Constraints

Author(s): Feldman, Moran; Liu, Paul; Norouzi-Fard, Ashkan; Svensson, Ola; Zenklusen, Rico
Published in: 49th EATCS International Conference on Automata, Languages, and Programming (ICALP), 2022, Page(s) 59:1-59:20
Publisher: Dagstuhl Publishing
DOI: 10.48550/arxiv.2107.07183

Ghost Value Augmentation for k-Edge-Connectivity

Author(s): D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
Published in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Page(s) 1853-1864
Publisher: ACM
DOI: 10.1145/3618260.3649715

Submodular Maximization Subject to Matroid Intersection on the Fly

Author(s): Feldman, Moran; Norouzi-Fard, Ashkan; Svensson, Ola; Zenklusen, Rico
Published in: Proceedings of the 30th Annual European Symposium on Algorithms (ESA), 2022, Page(s) 52:1-52:14
Publisher: Dagstuhl Publishing
DOI: 10.4230/lipics.esa.2022.52

Advances on Strictly $Δ$-Modular IPs

Author(s): Nägele, Martin; id_orcid0000-0002-3059-6402; Nöbel, Christian; Santiago, Richard; Zenklusen, Rico
Published in: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), Issue 11, 2023, Page(s) 393-407
Publisher: Springer
DOI: 10.48550/arxiv.2302.07029

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

Peer reviewed articles (10)

A new contraction technique with applications to congruency-constrained cuts

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

A New Dynamic Programming Approach for Spanning Trees with Chain Constraints and Beyond

Author(s): Martin Nägele; Rico Zenklusen
Published in: Mathematics of Operations Research, 2023, ISSN 0364-765X
Publisher: Institute for Operations Research and the Management Sciences
DOI: 10.1137/1.9781611975482.94

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: Journal of the ACM, 2023, Page(s) 1-52, ISSN 0004-5411
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3588564

Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf tree and connectivity augmentation

Author(s): Cecchetto, Frederica; Traub, Vera; Zenklusen, Rico
Published in: Mathematical Programming, 2023, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-023-02018-3

A simple optimal contention resolution scheme for uniform matroids

Author(s): Danish Kashaev, Richard Santiago
Published in: Theoretical Computer Science, Issue 940, 2022, Page(s) 81-96, ISSN 0304-3975
Publisher: Elsevier BV
DOI: 10.1016/j.tcs.2022.10.042

An Optimal Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint

Author(s): Simon Bruggmann, Rico Zenklusen
Published in: Mathematical Programming, Issue 00255610, 2022, Page(s) 191(2):795-845, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-020-01570-6

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

Author(s): Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Published in: Mathematical Programming, Issue 00255610, 2022, Page(s) 192(1):3-27, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-021-01645-y

Advances on strictly $$\Delta $$-modular IPs

Author(s): Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
Published in: Mathematical Programming, 2024, ISSN 0025-5610
Publisher: Springer Verlag
DOI: 10.1007/s10107-024-02148-2

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems

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

A framework for the secretary problem on the intersection of matroids

Author(s): Moran Feldman; Ola Svensson; Rico Zenklusen
Published in: SIAM Journal on Computing, Issue 00975397, 2022, Page(s) 51(3):766-819, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.48550/arxiv.1704.02608

Thesis and dissertations (2)

Constant-Competitive Online Selection Algorithms with Almost no Prior Information

Author(s): Ivan Sergeev
Published in: 2023
Publisher: ETH Zurich

Efficient Methods for Congruency-Constrained Optimization

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

Book chapters (2)

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, Issue 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