Laura SanitÓ
Laura SanitÓ
Associate Professor, Bocconi University of Milan
Verified email at - Homepage
Cited by
Cited by
An improved LP-based approximation for Steiner tree
J Byrka, F Grandoni, T Rothvo▀, L Sanita
Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010
Steiner tree approximation via iterative randomized rounding
J Byrka, F Grandoni, T Rothvo▀, L SanitÓ
Journal of the ACM (JACM) 60 (1), 1-33, 2013
Approximating weighted tree augmentation via Chvßtal-Gomory cuts
S Fiorini, M Gro▀, J K÷nemann, L SanitÓ
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discreteá…, 2018
The school bus problem on trees
A Bock, E Grant, J K÷nemann, L SanitÓ
Algorithmica 67, 49-64, 2013
0/1 polytopes with quadratic Chvßtal rank
T Rothvo▀, L Sanita
International Conference on Integer Programming and Combinatorialá…, 2013
An LMP O (log n)-approximation algorithm for node weighted prize collecting Steiner tree
J K÷nemann, S Sadeghian, L Sanita
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 568-577, 2013
Finding small stabilizers for unstable graphs
A Bock, K Chandrasekaran, J K÷nemann, B Peis, L SanitÓ
Mathematical Programming 154 (1), 173-196, 2015
Pivot rules for circuit-augmentation algorithms in linear optimization
JA De Loera, S Kafer, L SanitÓ
SIAM Journal on Optimization 32 (3), 2156-2179, 2022
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
AE Feldmann, J K÷nemann, N Olver, L SanitÓ
Mathematical programming 160, 379-406, 2016
An exact algorithm for robust network design
C Buchheim, F Liers, L SanitÓ
International Conference on Network Optimization, 7-17, 2011
On the circuit diameter of some combinatorial polytopes
S Kafer, K Pashkovich, L Sanita
SIAM Journal on Discrete Mathematics 33 (1), 1-25, 2019
The diameter of the fractional matching polytope and its hardness implications
L SanitÓ
2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCSá…, 2018
From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk
F Grandoni, T Rothvo▀, L Sanita
Mathematics of Operations Research 36 (2), 185-204, 2011
Robust network design
L SanitÓ
UniversitÓ Sapienza di Roma, 2009
Stabilizing network bargaining games by blocking players
S Ahmadian, H Hosseinzadeh, L SanitÓ
Mathematical Programming 172 (1), 249-275, 2018
Algorithms for inverse optimization problems
S Ahmadian, U Bhaskar, L SanitÓ, C Swamy
26th Annual European Symposium on Algorithms (ESA 2018), 2018
The VPN problem with concave costs
S Fiorini, G Oriolo, L SanitÓ, DO Theis
SIAM Journal on Discrete Mathematics 24 (3), 1080-1090, 2010
On the complexity of the asymmetric VPN problem
T Rothvo▀, L Sanita
International Workshop on Approximation Algorithms for Combinatorialá…, 2009
A -Approximation Algorithm for Tree Augmentation via Chv\'atal-Gomory Cuts
S Fiorini, M Gro▀, J K÷nemann, L Sanita
arXiv preprint arXiv:1702.05567, 2017
On finding another room-partitioning of the vertices
J Edmonds, L SanitÓ
Electronic Notes in Discrete Mathematics 36, 1257-1264, 2010
The system can't perform the operation now. Try again later.
Articles 1–20