Laura SanitÓ
Laura SanitÓ
Associate Professor, C&O Department - University of Waterloo
Verified email at uwaterloo.ca
Title
Cited by
Cited by
Year
An improved LP-based approximation for Steiner tree
J Byrka, F Grandoni, T Rothvo▀, L SanitÓ
Proceedings of the forty-second ACM symposium on Theory of computing, 583-592, 2010
3092010
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
1802013
An LMP O (log n)-approximation algorithm for node weighted prize collecting Steiner tree
J K÷nemann, S Sadeghian, L SanitÓ
2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 568-577, 2013
232013
Finding small stabilizers for unstable graphs
A Bock, K Chandrasekaran, J K÷nemann, B Peis, L SanitÓ
Mathematical Programming 154 (1-2), 173-196, 2015
192015
0/1 polytopes with quadratic Chvßtal rank
T Rothvo▀, L Sanita
International Conference on Integer Programming and Combinatorialá…, 2013
182013
Environmental margin and island evolution in M iddle E astern populations of the E gyptian fruit bat
P Hulva, T Marešovß, H Dundarova, R Bilgin, P Benda, T Bartonička, ...
Molecular Ecology 21 (24), 6104-6116, 2012
162012
An exact algorithm for robust network design
C Buchheim, F Liers, L SanitÓ
International Conference on Network Optimization, 7-17, 2011
162011
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
162011
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
162011
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
152018
Robust network design
L SanitÓ
UniversitÓ Sapienza di Roma, 2009
142009
Robust network design
L SanitÓ
UniversitÓ Sapienza di Roma, 2009
142009
On finding another room-partitioning of the vertices
J Edmonds, L SanitÓ
Electronic Notes in Discrete Mathematics 36, 1257-1264, 2010
122010
The VPN problem with concave costs
S Fiorini, G Oriolo, L SanitÓ, DO Theis
SIAM Journal on Discrete Mathematics 24 (3), 1080-1090, 2010
122010
The VPN problem with concave costs
S Fiorini, G Oriolo, L SanitÓ, DO Theis
SIAM Journal on Discrete Mathematics 24 (3), 1080-1090, 2010
122010
On the complexity of the asymmetric VPN problem
T Rothvo▀, L Sanita
Approximation, Randomization, and Combinatorial Optimization. Algorithms andá…, 2009
122009
Stabilizing network bargaining games by blocking players
S Ahmadian, H Hosseinzadeh, L SanitÓ
Mathematical Programming 172 (1-2), 249-275, 2018
112018
A 3 2-approximation algorithm for tree augmentation via chvßtal-gomory cuts
S Fiorini, M Gro▀, J K÷nemann, L Sanitß
15th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 77, 2017
112017
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
AE Feldmann, J K÷nemann, N Olver, L SanitÓ
Mathematical programming 160 (1-2), 379-406, 2016
112016
The school bus problem on trees
A Bock, E Grant, J K÷nemann, L SanitÓ
Algorithmica 67 (1), 49-64, 2013
112013
The system can't perform the operation now. Try again later.
Articles 1–20