pith. sign in

Laura Sanit\`a

Identifiers

  • name variant Laura Sanit\`a 0.60 · backfill

Papers (13)

  1. An Efficient Characterization of Submodular Spanning Tree Games cs.GT · 2019 · author #2
  2. The diameter of the fractional matching polytope and its hardness implications math.CO · 2018 · author #1
  3. On the approximability of the stable marriage problem with one-sided ties cs.DS · 2018 · author #3
  4. On the Circuit Diameter of some Combinatorial Polytopes math.OC · 2017 · author #3
  5. Stabilizing Weighted Graphs cs.DS · 2017 · author #2
  6. Single-sink Fractionally Subadditive Network Design cs.DS · 2017 · author #4
  7. A $\frac{3}{2}$-Approximation Algorithm for Tree Augmentation via Chv\'atal-Gomory Cuts cs.DM · 2017 · author #4
  8. Fast Approximation Algorithms for the Generalized Survivable Network Design Problem math.OC · 2016 · author #4
  9. On the existence of compact {\epsilon}-approximated formulations for knapsack in the original space math.OC · 2015 · author #2
  10. An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree cs.DS · 2013 · author #3
  11. Set Covering with Ordered Replacement -- Additive and Multiplicative Gaps cs.DM · 2010 · author #4
  12. The Virtual Private Network Design Problem with Concave Costs (Oberwolfach abstract) math.OC · 2008 · author #3
  13. The VPN Tree Routing Conjecture for Outerplanar Networks math.OC · 2007 · author #3

Mentions

  • 1012.3295 #4 · backfill · confidence 0.70 Laura Sanit\`a
  • 0812.2355 #3 · backfill · confidence 0.70 Laura Sanit\`a
  • 0711.2623 #3 · backfill · confidence 0.70 Laura Sanit\`a

Frequent Coauthors