Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Zenklusen, Rico
152  Ergebnisse:
Personensuche X
?
1

Ghost Value Augmentation for k-Edge-Connectivity:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
Hershkowitz, D. Ellis ; Klein, Nathan ; Zenklusen, Rico - p. 1853-1864 , 2024
Link: https://dl.acm.org/doi/1..
 
?
2

Advances on Strictly $$\varDelta $$-Modular IPs:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Nägele, Martin ; Nöbel, Christian ; Santiago, Richard. - p. 393-407 , 2023
Link: https://doi.org/10.1007/..
 
?
3

Constant-Competitiveness for Random Assignment Matroid Secr..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Santiago, Richard ; Sergeev, Ivan ; Zenklusen, Rico - p. 423-437 , 2023
Link: https://doi.org/10.1007/..
 
?
4

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

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Traub, Vera ; Zenklusen, Rico - p. 1820-1833 , 2023
Link: https://dl.acm.org/doi/1..
 
?
5

The One-Way Communication Complexity of Submodular Maximiza..:

Feldman, Moran ; Norouzi-Fard, Ashkan ; Svensson, Ola.
Journal of the ACM.  70 (2023)  4 - p. 1-52 , 2023
Link: https://doi.org/10.1145/..
 
?
6

Bridging the Gap Between Tree and Connectivity Augmentation..:

Cecchetto, Federica ; Traub, Vera ; Zenklusen, Rico
SIAM Journal on Computing.  , 2023
Link: https://doi.org/10.1137/..
 
?
7

Better-than-$$\frac{4}{3}$$-approximations for leaf-to-leaf..:

Cecchetto, Federica ; Traub, Vera ; Zenklusen, Rico
Mathematical Programming.  , 2023
Link: https://doi.org/10.1007/..
 
?
8

A Better-Than-2 Approximation for Weighted Tree Augmentatio:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),
Traub, Vera ; Zenklusen, Rico - p. 1-12 , 2022
Link: https://doi.org/10.1109/..
 
?
9

A Framework for the Secretary Problem on the Intersection o..:

Feldman, Moran ; Svensson, Ola ; Zenklusen, Rico
SIAM Journal on Computing.  51 (2022)  3 - p. 766-819 , 2022
Link: https://doi.org/10.1137/..
 
?
10

Reducing Path TSP to TSP:

Traub, Vera ; Vygen, Jens ; Zenklusen, Rico
SIAM Journal on Computing.  51 (2021)  3 - p. STOC20-24-STOC20-53 , 2021
Link: https://doi.org/10.1137/..
 
?
11

Bridging the gap between tree and connectivity augmentation..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,
Cecchetto, Federica ; Traub, Vera ; Zenklusen, Rico - p. 370-383 , 2021
Link: https://dl.acm.org/doi/1..
 
?
12

Online Contention Resolution Schemes with Applications to B..:

Feldman, Moran ; Svensson, Ola ; Zenklusen, Rico
SIAM Journal on Computing.  50 (2021)  2 - p. 255-300 , 2021
Link: https://doi.org/10.1137/..
 
?
13

A technique for obtaining true approximations for k-center ..:

Anegg, Georg ; Angelidakis, Haris ; Kurpisz, Adam.
Mathematical Programming.  192 (2021)  1-2 - p. 3-27 , 2021
Link: https://doi.org/10.1007/..
 
?
14

A Technique for Obtaining True Approximations for k-Center ..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Anegg, Georg ; Angelidakis, Haris ; Kurpisz, Adam. - p. 52-65 , 2020
Link: https://doi.org/10.1007/..
 
?
15

An optimal monotone contention resolution scheme for bipart..:

Bruggmann, Simon ; Zenklusen, Rico
Mathematical Programming.  191 (2020)  2 - p. 795-845 , 2020
Link: https://doi.org/10.1007/..
 
1-15