Skip to main content

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

Searching for OpenAIRE data...


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
DOI: 10.1145/3357713.3384256

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
DOI: 10.1145/3357713.3384286

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
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, Issue 50/2, 2021, Page(s) 255-300, ISSN 0097-5397
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
DOI: 10.1137/1.9781611976496.22