pith. sign in

Rico Zenklusen

Identifiers

  • name variant Rico Zenklusen 0.60 · backfill

Papers (33)

  1. Reducing Path TSP to TSP cs.DM · 2019 · author #3
  2. An Optimal Monotone Contention Resolution Scheme for Bipartite Matchings via a Polyhedral Viewpoint cs.DS · 2019 · author #2
  3. Approximate Multi-Matroid Intersection via Iterative Refinement cs.DS · 2018 · author #4
  4. A 1.5-Approximation for Path TSP cs.DM · 2018 · author #1
  5. Improved Approximation for Tree Augmentation: Saving by Rewiring cs.DS · 2018 · author #3
  6. Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting cs.DM · 2017 · author #3
  7. Submodular Maximization through the Lens of Linear Programming cs.DS · 2017 · author #2
  8. Submodular Minimization Under Congruency Constraints cs.DS · 2017 · author #3
  9. A Framework for the Secretary Problem on the Intersection of Matroids cs.DS · 2017 · author #3
  10. Extension complexities of Cartesian products involving a pyramid math.OC · 2017 · author #3
  11. Local Search for Max-Sum Diversification cs.DS · 2016 · author #3
  12. Firefighting on Trees Beyond Integrality Gaps cs.DS · 2016 · author #3
  13. Sublinear Bounds for a Quantitative Doignon-Bell-Scarf Theorem math.OC · 2015 · author #3
  14. k-Trails: Recognition, Complexity, and Approximations cs.DS · 2015 · author #2
  15. Max-sum diversity via convex programming cs.DS · 2015 · author #3
  16. Hardness and Approximation for Network Flow Interdiction cs.DS · 2015 · author #2
  17. Interdicting Structured Combinatorial Optimization Problems with {0,1}-Objectives math.OC · 2015 · author #2
  18. Mixed Integer Reformulations of Integer Programs and the Affine TU-dimension of a Matrix math.OC · 2015 · author #4
  19. An O(1)-Approximation for Minimum Spanning Tree Interdiction cs.DS · 2015 · author #1
  20. Online Contention Resolution Schemes cs.DS · 2015 · author #3
  21. The Submodular Secretary Problem Goes Linear cs.DS · 2015 · author #2
  22. Matroids are Immune to Braess Paradox cs.GT · 2015 · author #5
  23. A Simple $O(\log\log(\mathrm{rank}))$-Competitive Algorithm for the Matroid Secretary Problem cs.DS · 2014 · author #3
  24. Advances on Matroid Secretary Problems: Free Order Model and Laminar Case cs.DS · 2012 · author #3
  25. Matroids and Integrality Gaps for Hypergraphic Steiner Tree Relaxations cs.DM · 2011 · author #4
  26. Matroidal Degree-Bounded Minimum Spanning Trees cs.DS · 2011 · author #1
  27. Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes cs.DM · 2011 · author #3
  28. Optimization with More than One Budget cs.DS · 2010 · author #2
  29. Dependent Randomized Rounding for Matroid Polytopes and Applications cs.DS · 2009 · author #3
  30. Matching Interdiction cs.DM · 2008 · author #1
  31. Extensions to Network Flow Interdiction on Planar Graphs cs.DM · 2008 · author #1
  32. Estimation of Small s-t Reliabilities in Acyclic Networks cs.DM · 2007 · author #2
  33. A tight bound on the collection of edges in MSTs of induced subgraphs math.CO · 2007 · author #3

Mentions

  • 1404.4473 #3 · backfill · confidence 0.70 Rico Zenklusen
  • 1207.1333 #3 · backfill · confidence 0.70 Rico Zenklusen
  • 1111.7280 #4 · backfill · confidence 0.70 Rico Zenklusen
  • 1107.5329 #1 · backfill · confidence 0.70 Rico Zenklusen
  • 1105.4593 #3 · backfill · confidence 0.70 Rico Zenklusen
  • 1002.2147 #2 · backfill · confidence 0.70 Rico Zenklusen
  • 0909.4348 #3 · backfill · confidence 0.70 Rico Zenklusen
  • 0804.3583 #1 · backfill · confidence 0.70 Rico Zenklusen
  • 0801.1737 #1 · backfill · confidence 0.70 Rico Zenklusen
  • 0707.3231 #2 · backfill · confidence 0.70 Rico Zenklusen
  • 0705.2439 #3 · backfill · confidence 0.70 Rico Zenklusen

Frequent Coauthors