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

Información del proyecto

ICOPT

Identificador del acuerdo de subvención: 817750

DOI

10.3030/817750

Proyecto cerrado

Fecha de la firma de la CE 17 Enero 2019

Fecha de inicio 1 Noviembre 2019

Fecha de finalización 31 Octubre 2024

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 443 422,00

Aportación de la UE

€ 1 443 422,00

Coordinado por

EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Switzerland

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Conference proceedings (18)

Reducing path TSP to TSP

Autores: Vera Traub, Jens Vygen, Rico Zenklusen
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 14-27, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384256

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

Autores: Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Publicado en: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Página(s) 84-95
Editor: SIAM
DOI: 10.1137/1.9781611977585.ch8

Fair and Fast k-Center Clustering for Data Summarization

Autores: Haris Angelidakis, Adam Kurpisz, Leon Sering, Rico Zenklusen
Publicado en: Proceedings of the 39th International Conference on Machine Learning (ICML), 2022, Página(s) 162:669-702
Editor: PMLR

Complexity of Polytope Diameters via Perfect Matchings

Autores: Christian Nöbel, Raphael Steiner
Publicado en: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2025
Editor: ACM-SIAM

A Better-Than-2 Approximation for Weighted Tree Augmentation

Autores: Traub, Vera; Zenklusen, Rico
Publicado en: Proceedings of the IEEE Symposium on Foundations on Computer Science (FOCS), 2021, Página(s) 1-12
Editor: IEEE

Congruency-Constrained TU Problems Beyond the Bimodular Case

Autores: Martin Nägele, Richard Santiago, Rico Zenklusen
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Página(s) 2743-2790
Editor: ACM-SIAM
DOI: 10.1137/1.9781611977073.108

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

Autores: Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Publicado en: Proceedings of the 52th ACM Symposium on Theory of Computing (STOC), 2020, Página(s) 1363-1374, ISBN 978-1-4503-6979-4
Editor: ACM
DOI: 10.1145/3357713.3384286

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

Autores: Santiago, Richard; Sergeev, Ivan; Zenklusen, Rico
Publicado en: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2023, Página(s) 423-437
Editor: Springer
DOI: 10.1007/978-3-031-32726-1_30

Local Search for Weighted Tree Augmentation and Steiner Tree

Autores: Vera Traub, Rico Zenklusen
Publicado en: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2022, Página(s) 3253-3272
Editor: ACM-SIAM
DOI: 10.1137/1.9781611977073.128

A Simple Combinatorial Algorithm for Robust Matroid Center

Autores: Anegg, Georg; Koch, Laura Vargas; Zenklusen, Rico
Publicado en: 2023 Symposium on Simplicity in Algorithms (SOSA), 2023, Página(s) 96-102
Editor: SIAM
DOI: 10.1137/1.9781611977585.ch9

Techniques for Generalized Colorful $k$-Center Problems

Autores: Anegg, Georg; Vargas Koch, Laura; Zenklusen, Rico
Publicado en: Proceedings of the 30th Annual European Symposium on Algorithms (ESA), 2022, Página(s) 7:1-7:14
Editor: Dagstuhl Publishing
DOI: 10.48550/arxiv.2207.02609

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

Autores: Traub, Vera; Zenklusen, Rico
Publicado en: STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023, Página(s) 1820-1833
Editor: ACM
DOI: 10.1145/3564246.3585122

Single-Source Unsplittable Flows in Planar Graphs

Autores: Traub, Vera; Koch, Laura Vargas; Zenklusen, Rico
Publicado en: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024
Editor: SIAM
DOI: 10.1137/1.9781611977912.24

Streaming Submodular Maximization Under Matroid Constraints

Autores: Feldman, Moran; Liu, Paul; Norouzi-Fard, Ashkan; Svensson, Ola; Zenklusen, Rico
Publicado en: 49th EATCS International Conference on Automata, Languages, and Programming (ICALP), 2022, Página(s) 59:1-59:20
Editor: Dagstuhl Publishing
DOI: 10.48550/arxiv.2107.07183

Ghost Value Augmentation for k-Edge-Connectivity

Autores: D. Ellis Hershkowitz, Nathan Klein, Rico Zenklusen
Publicado en: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024, Página(s) 1853-1864
Editor: ACM
DOI: 10.1145/3618260.3649715

Submodular Maximization Subject to Matroid Intersection on the Fly

Autores: Feldman, Moran; Norouzi-Fard, Ashkan; Svensson, Ola; Zenklusen, Rico
Publicado en: Proceedings of the 30th Annual European Symposium on Algorithms (ESA), 2022, Página(s) 52:1-52:14
Editor: Dagstuhl Publishing
DOI: 10.4230/lipics.esa.2022.52

Advances on Strictly $Δ$-Modular IPs

Autores: Nägele, Martin; id_orcid0000-0002-3059-6402; Nöbel, Christian; Santiago, Richard; Zenklusen, Rico
Publicado en: Proceedings of the 24th Conference on Integer Programming and Combinatorial Optimization (IPCO), Edición 11, 2023, Página(s) 393-407
Editor: Springer
DOI: 10.48550/arxiv.2302.07029

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

Autores: Federica Cecchetto; Vera Traub; Rico Zenklusen
Publicado en: Proceedings of the 53rd ACM Symposium on Theory of Computing (STOC), 2021, Página(s) 370-383
Editor: ACM
DOI: 10.1145/3406325.3451086

Peer reviewed articles (10)

A new contraction technique with applications to congruency-constrained cuts

Autores: Martin Nägele, Rico Zenklusen
Publicado en: Mathematical Programming, Edición 183/1-2, 2020, Página(s) 455-481, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-020-01498-x

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

Autores: Martin Nägele; Rico Zenklusen
Publicado en: Mathematics of Operations Research, 2023, ISSN 0364-765X
Editor: 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

Autores: Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Publicado en: Journal of the ACM, 2023, Página(s) 1-52, ISSN 0004-5411
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3588564

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

Autores: Cecchetto, Frederica; Traub, Vera; Zenklusen, Rico
Publicado en: Mathematical Programming, 2023, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-023-02018-3

A simple optimal contention resolution scheme for uniform matroids

Autores: Danish Kashaev, Richard Santiago
Publicado en: Theoretical Computer Science, Edición 940, 2022, Página(s) 81-96, ISSN 0304-3975
Editor: Elsevier BV
DOI: 10.1016/j.tcs.2022.10.042

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

Autores: Simon Bruggmann, Rico Zenklusen
Publicado en: Mathematical Programming, Edición 00255610, 2022, Página(s) 191(2):795-845, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-020-01570-6

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

Autores: Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Publicado en: Mathematical Programming, Edición 00255610, 2022, Página(s) 192(1):3-27, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-021-01645-y

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

Autores: Martin Nägele, Christian Nöbel, Richard Santiago, Rico Zenklusen
Publicado en: Mathematical Programming, 2024, ISSN 0025-5610
Editor: Springer Verlag
DOI: 10.1007/s10107-024-02148-2

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems

Autores: Moran Feldman, Ola Svensson, Rico Zenklusen
Publicado en: SIAM Journal on Computing, Edición 50/2, 2021, Página(s) 255-300, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/18m1226130

A framework for the secretary problem on the intersection of matroids

Autores: Moran Feldman; Ola Svensson; Rico Zenklusen
Publicado en: SIAM Journal on Computing, Edición 00975397, 2022, Página(s) 51(3):766-819, ISSN 0097-5397
Editor: 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

Autores: Ivan Sergeev
Publicado en: 2023
Editor: ETH Zurich

Efficient Methods for Congruency-Constrained Optimization

Autores: Nägele, Martin
Publicado en: 2021
Editor: 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

Autores: Georg Anegg, Haris Angelidakis, Rico Zenklusen
Publicado en: Symposium on Simplicity in Algorithms (SOSA), 2021, Página(s) 196-203, ISBN 978-1-61197-649-6
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976496.22

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

Autores: Georg Anegg, Haris Angelidakis, Adam Kurpisz, Rico Zenklusen
Publicado en: Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, London, UK, June 8–10, 2020, Proceedings, Edición 12125, 2020, Página(s) 52-65, ISBN 978-3-030-45770-9
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-45771-6_5