Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Filters

Rico Zenklusen

Showing results (1-10 of 5) with videos related to

Pageof 1
Sort By:
Mathematical Programming|March 7, 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpointSimon Bruggmann, Rico Zenklusen
Mathematical Programming|March 3, 2025
Constant-competitiveness for random assignment Matroid secretary without knowing the MatroidRichard Santiago, Ivan Sergeev, Rico Zenklusen
Mathematical Programming|August 12, 2024
Better-than- <math></math> -approximations for leaf-to-leaf tree and connectivity augmentationFederica Cecchetto, Vera Traub, Rico Zenklusen
Mathematical Programming|March 18, 2022
A technique for obtaining true approximations for <i>k</i>-center with covering constraintsGeorg Anegg, Haris Angelidakis, Adam Kurpisz, et al.
Mathematical Programming|March 3, 2025
Advances on strictly <math></math> -modular IPsMartin Nägele, Christian Nöbel, Richard Santiago, et al.
Pageof 1

Showing results (1-10 of 5) with videos related to

Sort By:
Pageof 1
Mathematical Programming|March 7, 2022
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpointSimon Bruggmann, Rico Zenklusen
Mathematical Programming|March 3, 2025
Constant-competitiveness for random assignment Matroid secretary without knowing the MatroidRichard Santiago, Ivan Sergeev, Rico Zenklusen
Mathematical Programming|August 12, 2024
Better-than- <math></math> -approximations for leaf-to-leaf tree and connectivity augmentationFederica Cecchetto, Vera Traub, Rico Zenklusen
Mathematical Programming|March 18, 2022
A technique for obtaining true approximations for <i>k</i>-center with covering constraintsGeorg Anegg, Haris Angelidakis, Adam Kurpisz, et al.
Mathematical Programming|March 3, 2025
Advances on strictly <math></math> -modular IPsMartin Nägele, Christian Nöbel, Richard Santiago, et al.
Pageof 1