Подписаться
Rico Zenklusen
Rico Zenklusen
ETH Zurich
Подтвержден адрес электронной почты в домене math.ethz.ch - Главная страница
Название
Процитировано
Процитировано
Год
Submodular function maximization via the multilinear relaxation and contention resolution schemes
C Chekuri, J Vondrák, R Zenklusen
SIAM Journal on Computing 43 (6), 1831-1879, 2014
4252014
Dependent randomized rounding via exchange properties of combinatorial structures
C Chekuri, J Vondrák, R Zenklusen
Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on …, 2010
2882010
Online contention resolution schemes
M Feldman, O Svensson, R Zenklusen
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
1452016
A simple O (log log (rank))-competitive algorithm for the matroid secretary problem
M Feldman, O Svensson, R Zenklusen
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete …, 2015
1382015
A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling
G Caimi, F Chudak, M Fuchsberger, M Laumanns, R Zenklusen
Transportation science 45 (2), 212-227, 2011
1192011
Matching interdiction
R Zenklusen
Discrete Applied Mathematics 158 (15), 1676-1690, 2010
1112010
Multi-budgeted matchings and matroid intersection via dependent rounding
C Chekuri, J Vondrák, R Zenklusen
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
962011
A strongly polynomial algorithm for bimodular integer linear programming
S Artmann, R Weismantel, R Zenklusen
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
892017
Dependent randomized rounding for matroid polytopes and applications
C Chekuri, J Vondrak, R Zenklusen
Arxiv preprint arXiv:0909.4348, 2009
84*2009
Blockers and transversals
R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz
Discrete Mathematics 309 (13), 4306-4314, 2009
792009
Matroids and integrality gaps for hypergraphic steiner tree relaxations
MX Goemans, N Olver, T Rothvoß, R Zenklusen
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
762012
Stochastic convergence of random search methods to fixed size Pareto front approximations
M Laumanns, R Zenklusen
European Journal of Operational Research 213 (2), 414-421, 2011
702011
The one-way communication complexity of submodular maximization with applications to streaming and robustness
M Feldman, A Norouzi-Fard, O Svensson, R Zenklusen
Journal of the ACM 70 (4), 1-52, 2023
692023
Network flow interdiction on planar graphs
R Zenklusen
Discrete Applied Mathematics 158 (13), 1441-1455, 2010
662010
A 1.5-approximation for path TSP
R Zenklusen
Proceedings of the thirtieth annual ACM-SIAM symposium on discrete …, 2019
652019
New approaches to multi-objective optimization
F Grandoni, R Ravi, M Singh, R Zenklusen
Mathematical Programming 146, 525-554, 2014
632014
Advances on matroid secretary problems: Free order model and laminar case
P Jaillet, JA Soto, R Zenklusen
International Conference on Integer Programming and Combinatorial …, 2013
612013
Improved approximation for tree augmentation: saving by rewiring
F Grandoni, C Kalaitzis, R Zenklusen
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
582018
An algorithmic framework for wireless information flow
MX Goemans, S Iwata, R Zenklusen
2009 47th Annual Allerton Conference on Communication, Control, and …, 2009
582009
The submodular secretary problem goes linear
M Feldman, R Zenklusen
SIAM Journal on Computing 47 (2), 330-366, 2018
562018
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20