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
379 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
287 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
51 2018 The school bus problem on trees A Bock, E Grant, J Könemann, L Sanità
Algorithmica 67, 49-64, 2013
33 2013 0/1 polytopes with quadratic Chvátal rank T Rothvoß, L Sanita
International Conference on Integer Programming and Combinatorial …, 2013
29 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
26 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
24 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
21 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
21 2016 An exact algorithm for robust network design C Buchheim, F Liers, L Sanità
International Conference on Network Optimization, 7-17, 2011
19 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
17 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
16 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
16 2011 Robust network design L Sanità
Università Sapienza di Roma, 2009
16 2009 Stabilizing network bargaining games by blocking players S Ahmadian, H Hosseinzadeh, L Sanità
Mathematical Programming 172 (1), 249-275, 2018
15 2018 Algorithms for inverse optimization problems S Ahmadian, U Bhaskar, L Sanità, C Swamy
26th Annual European Symposium on Algorithms (ESA 2018), 2018
13 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
13 2010 On the complexity of the asymmetric VPN problem T Rothvoß, L Sanita
International Workshop on Approximation Algorithms for Combinatorial …, 2009
13 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
12 2017 On finding another room-partitioning of the vertices J Edmonds, L Sanità
Electronic Notes in Discrete Mathematics 36, 1257-1264, 2010
11 2010