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

Informazioni relative al progetto

ICOPT

ID dell’accordo di sovvenzione: 817750

DOI

10.3030/817750

Progetto chiuso

Data della firma CE 17 Gennaio 2019

Data di avvio 1 Novembre 2019

Data di completamento 31 Ottobre 2024

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 443 422,00

Contributo UE

€ 1 443 422,00

Coordinato da

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (18)

Reducing path TSP to TSP

Autori: Vera Traub, Jens Vygen, Rico Zenklusen
Pubblicato in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Pagina/e 14-27, ISBN 9781450369794
Editore: ACM
DOI: 10.1145/3357713.3384256

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

Autori: Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Pubblicato in: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Pagina/e 84-95
Editore: SIAM
DOI: 10.1137/1.9781611977585.ch8

Fair and Fast k-Center Clustering for Data Summarization

Autori: Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
Pubblicato in: Proceedings of the 39th International Conference on Machine Learning (ICML), 2022, Pagina/e 162:669-702
Editore: PMLR

Complexity of Polytope Diameters via Perfect Matchings

Autori: Christian Nöbel, Raphael Steiner
Pubblicato in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2025
Editore: ACM-SIAM

A Better-Than-2 Approximation for Weighted Tree Augmentation

Autori: Traub, Vera; Zenklusen, Rico
Pubblicato in: Proceedings of the IEEE Symposium on Foundations on Computer Science (FOCS), 2021, Pagina/e 1-12
Editore: IEEE

Congruency-Constrained TU Problems Beyond the Bimodular Case

Autori: Martin Nägele, Richard Santiago, Rico Zenklusen
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 2743-2790
Editore: ACM-SIAM
DOI: 10.1137/1.9781611977073.108

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

Autori: Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Pubblicato in: Proceedings of the 52th ACM Symposium on Theory of Computing (STOC), 2020, Pagina/e 1363-1374, ISBN 978-1-4503-6979-4
Editore: ACM
DOI: 10.1145/3357713.3384286

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

Autori: Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Pubblicato in: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2023, Pagina/e 423-437
Editore: Springer
DOI: 10.1007/978-3-031-32726-1_30

Local Search for Weighted Tree Augmentation and Steiner Tree

Autori: Vera Traub, Rico Zenklusen
Pubblicato in: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Pagina/e 3253-3272
Editore: ACM-SIAM
DOI: 10.1137/1.9781611977073.128

A Simple Combinatorial Algorithm for Robust Matroid Center

Autori: Anegg, Georg; Koch, Laura Vargas; Zenklusen, Rico
Pubblicato in: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Pagina/e 96-102
Editore: SIAM
DOI: 10.1137/1.9781611977585.ch9

Techniques for Generalized Colorful $k$-Center Problems

Autori: Anegg, Georg; Vargas Koch, Laura; Zenklusen, Rico
Pubblicato in: Proceedings of the 30th Annual European Symposium on Algorithms (ESA), 2022, Pagina/e 7:1-7:14
Editore: Dagstuhl Publishing
DOI: 10.48550/arxiv.2207.02609

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

Autori: Traub, Vera; Zenklusen, Rico
Pubblicato in: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Pagina/e 1820-1833
Editore: ACM
DOI: 10.1145/3564246.3585122

Single-Source Unsplittable Flows in Planar Graphs

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

Streaming Submodular Maximization Under Matroid Constraints

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

Ghost Value Augmentation for k-Edge-Connectivity

Autori: D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
Pubblicato in: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Pagina/e 1853-1864
Editore: ACM
DOI: 10.1145/3618260.3649715

Submodular Maximization Subject to Matroid Intersection on the Fly

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

Advances on Strictly $Δ$-Modular IPs

Autori: Nägele, Martin; id_orcid0000-0002-3059-6402; Nöbel, Christian; Santiago, Richard; Zenklusen, Rico
Pubblicato in: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), Numero 11, 2023, Pagina/e 393-407
Editore: Springer
DOI: 10.48550/arxiv.2302.07029

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

Autori: Federica Cecchetto; Vera Traub; Rico Zenklusen
Pubblicato in: Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC), 2021, Pagina/e 370-383
Editore: ACM
DOI: 10.1145/3406325.3451086

Peer reviewed articles (10)

A new contraction technique with applications to congruency-constrained cuts

Autori: Martin Nägele, Rico Zenklusen
Pubblicato in: Mathematical Programming, Numero 183/1-2, 2020, Pagina/e 455-481, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-020-01498-x

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

Autori: Martin Nägele; Rico Zenklusen
Pubblicato in: Mathematics of Operations Research, 2023, ISSN 0364-765X
Editore: 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

Autori: Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Pubblicato in: Journal of the ACM, 2023, Pagina/e 1-52, ISSN 0004-5411
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3588564

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

Autori: Cecchetto, Frederica; Traub, Vera; Zenklusen, Rico
Pubblicato in: Mathematical Programming, 2023, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-023-02018-3

A simple optimal contention resolution scheme for uniform matroids

Autori: Danish Kashaev, Richard Santiago
Pubblicato in: Theoretical Computer Science, Numero 940, 2022, Pagina/e 81-96, ISSN 0304-3975
Editore: Elsevier BV
DOI: 10.1016/j.tcs.2022.10.042

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

Autori: Simon Bruggmann, Rico Zenklusen
Pubblicato in: Mathematical Programming, Numero 00255610, 2022, Pagina/e 191(2):795-845, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-020-01570-6

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

Autori: Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Pubblicato in: Mathematical Programming, Numero 00255610, 2022, Pagina/e 192(1):3-27, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-021-01645-y

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

Autori: Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
Pubblicato in: Mathematical Programming, 2024, ISSN 0025-5610
Editore: Springer Verlag
DOI: 10.1007/s10107-024-02148-2

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems

Autori: Moran Feldman, Ola Svensson, Rico Zenklusen
Pubblicato in: SIAM Journal on Computing, Numero 50/2, 2021, Pagina/e 255-300, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1226130

A framework for the secretary problem on the intersection of matroids

Autori: Moran Feldman; Ola Svensson; Rico Zenklusen
Pubblicato in: SIAM Journal on Computing, Numero 00975397, 2022, Pagina/e 51(3):766-819, ISSN 0097-5397
Editore: 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

Autori: Ivan Sergeev
Pubblicato in: 2023
Editore: ETH Zurich

Efficient Methods for Congruency-Constrained Optimization

Autori: Nägele, Martin
Pubblicato in: 2021
Editore: 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

Autori: Georg Anegg, Haris Angelidakis, Rico Zenklusen
Pubblicato in: Symposium on Simplicity in Algorithms (SOSA), 2021, Pagina/e 196-203, ISBN 978-1-61197-649-6
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976496.22

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

Autori: Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Pubblicato in: Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings, Numero 12125, 2020, Pagina/e 52-65, ISBN 978-3-030-45770-9
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-45771-6_5