( en | de | ru )

 

Disambiguation of "Zenklusen, Rico"

Author of the publication

copydeleteadd this publication to your clipboard
Submodular Minimization Under Congruency Constraints.

, , and . Comb., 39 (6): 1351-1386 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Daniel Zenklusen

Fabian Zenklusen

Cristina Rico García

Andreas Ricoeur

Mariano Rico Universidad Politecnica de Madrid

 

Other publications of authors with the same name

A Framework for the Secretary Problem on the Intersection of Matroids., , and . CoRR, (2017)Network design with a discrete set of traffic matrices., , and . Oper. Res. Lett., 41 (4): 390-396 (2013)Bisections above Tight Lower Bounds., and . WG, volume 7551 of Lecture Notes in Computer Science, page 184-193. Springer, (2012)Approximation Schemes for Multi-Budgeted Independence Systems., and . ESA (1), volume 6346 of Lecture Notes in Computer Science, page 536-548. Springer, (2010)Reducing Path TSP to TSP., , and . SIAM J. Comput., 51 (3): 20-24 (June 2022)Submodular Minimization Under Congruency Constraints., , and . SODA, page 849-866. SIAM, (2018)Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting., , and . SODA, page 788-807. SIAM, (2018)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . SODA, page 1189-1201. SIAM, (2015)Local Search for Weighted Tree Augmentation and Steiner Tree., and . SODA, page 3253-3272. SIAM, (2022)Advances on Strictly $\varDelta $-Modular IPs., , , and . IPCO, volume 13904 of Lecture Notes in Computer Science, page 393-407. Springer, (2023)