Laura Sanità

  Assistant Professor
  Combinatorics & Optimization Department
  University of Waterloo
  200 University Ave. W
  Waterloo, Ontario
  Canada, N2L 3G1
  Room: MC 5037

  Phone: (519) 888-4567 x 31395
  Email: laura.sanita [at] uwaterloo [dot] ca

  Research Interests:
  Network Design, Approximation Algorithms, Combinatorial Optimization, Operations Research




Short Bio

July 2003: Bachelor degree in Management Engineering, from "Università di Roma Tor Vergata", Italy.
October 2005: Master degree in Management Engineering, from "Università di Roma Tor Vergata", Italy.
November 2005 — January 2009:  Ph.D. student in Operations Research, "Università Sapienza di Roma", Italy.
May 2007 — July 2007: Adonet position at "Institut für Informatik, Universität zu Köln", Cologne, Germany.
January 2009: Doctoral degree in Operations Research, from "Università Sapienza di Roma", Rome, Italy.
February 2009 — August 2011: PostDoc at Discrete Optimization Group, EPFL, Lausanne, Switzerland.
September 2011 — December 2011: World Trip (here is my route!)
...since January 2012: Assistant Professor at C&O, University of Waterloo, Canada.

 

Publications

Note:   Colours distinguish Journals, Conference Proceedings, or Others. Authors are listed in alphabetical order.


Submitted  

  • Jochen Koenemann, Sina Sadeghian, Laura Sanità, An LMP O(log n)-Approximation Algorithm for Node Weighted Prize Collecting Steiner Tree.
  • Jochen Koenemann, Sina Sadeghian, Laura Sanità, Better Approximation Algorithms for Technology Diffusion.
  • Adrian Bock, Laura Sanità, The capacitated orienteering problem.

2013

  • Thomas Rothvoss, Laura Sanità, 0/1 Polytopes with quadratic Chvatal rank. 16th Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), LNCS Volume 7801, 2013, pages 349-361.
  • Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss, Laura Sanità, Steiner Tree approximation via iterative randomized rounding, Journal of the ACM, Volume 60 Issue 1, 2013.
  • Nicolai Haehnle, Laura Sanità, Rico Zenklusen, Stable routing and unique-max coloring on trees, Siam Journal on Discrete Mathematics, 27(1), pages 109 - 125, 2013.
  • Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen, Network design with a discrete set of traffic matrices. Operations Research Letters, Accepted.
    •  

2012

  • Jack Edmonds, Laura Sanità, Exponentiality of the exchange algorithm for finding another room-partitioning, Discrete Applied Mathematics, DOI: http://dx.doi.org/10.1016/j.dam.2012.03.012, 2012.
  • Adrian Bock, Elyot Grant, Jochen Koenemann, Laura Sanità, The School Bus Problem on Trees. Algorithmica, DOI: http://dx.doi.org/10.1007/s00453-012-9711-x, 2012.
     

2011

  • Adrian Bock, Elyot Grant, Jochen Koenemann, Laura Sanità, The School Bus Problem on Trees. 22nd International Symposium on Algorithms and Computation (ISAAC 2011).
  • Friedrich Eisenbrand, Naonori Kakimura, Thomas Rothvoss, Laura Sanità, Set covering with ordered replacement -- Additive and multiplicative gaps, 15th Conference on Integer Programming and Combinatorial Optimization (IPCO 2011), LNCS 6655, pages 170-182, 2011.
  • Christoph Buchheim, Frauke Liers, Laura Sanità, An exact algorithm for robust network design, International Network Optimization Conference (INOC 2011), LNCS 6701, pages 7-17, 2011.
  • Fabrizio Grandoni, Thomas Rothvoss, Laura Sanità, From Uncertainty to Non-Linearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk, Mathematics of Operations Research, Vol. 36, No. 2, pages 185 - 204, (2011).

    •  

2010

  • Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvoss, Laura Sanità, An improved LP-based approximation for Steiner Tree, Proceedings of the 42th ACM Symposium on Theory of Computing (STOC 2010), pages 583-592. Best Paper Award.
  • Jack Edmonds, Laura Sanità, On finding another room-partitioning of the vertices, Proceedings of (ISCO 2010) ENDM 36 (2010), pages 1257-1264.
  • Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanità, The interval constrained 3-coloring problem, A. Lopez-Ortiz (Ed.): LATIN 2010, LNCS 6034, pages 591-602, (2010).
  • Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis, The VPN problem with concave costs, Siam Journal on Discrete Mathematics, Volume 24, Issue 3, pages 1080-1090, (2010).
  • Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Stable Routing under the Spanning Tree Protocol, Operations Research Letters, Volume 38, Issue 5, pages 399-404 (2010).

    •  

2009

  • Thomas Rothvoss, Laura Sanità, On the complexity of the asymmetric VPN problem, Dinur et al. (Eds.): APPROX and RANDOM 2009, LNCS 5687, pages 326-338, 2009.
  • Paola Iovanna, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità, Ezio Sperduto, Local restoration for trees and arborescences, R. Valadas and P. Salvador (Eds.): FITraMEn 2008, LNCS 5464, pages 130-140, 2009.
  • Laura Sanità, Robust Network Design, Ph.D. thesis, Università “Sapienza” di Roma, January 2009.
     

2008

  • Paola Iovanna, Gianpaolo Oriolo, Roberto Sabella, Laura Sanità, Fine protection of data paths in multi-layer network based on the GMPLS paradigm, Optical Switching and Networking, 5, pages 159- 169, 2008. 
     

Patent

  • Paola Iovanna, Gianpaolo Oriolo, Roberto Sabella, Laura Sanità, Communication Network, Patent, Pub. No: WO/2009/106153.

     

Teaching

Spring 2013
CO 250: "Introduction to Optimization".

Fall 2012
CO 450 - CO 650: "Combinatorial Optimization".

Spring 2012
CO 250: "Introduction to Optimization".