SANITA', LAURA
SANITA', LAURA
Dipartimento di Scienze della Computazione
0/1 Polytopes with quadratic Chvátal rank
2013 Rothvoss, T.; Sanita, Laura.
0/1 polytopes with quadratic Chvátal rank
2017 Rothvoss, T.; Sanita, Laura.
Algorithms for inverse optimization problems
2018 Ahmadian, S.; Bhaskar, U.; Sanita', Laura; Swamy, C.
An efficient characterization of submodular spanning tree games
2020 Koh, Zhuan Khye; Sanita', Laura
An Efficient Characterization of Submodular Spanning Tree Games
2019 Koh, Z. K.; Sanita', Laura
An exact algorithm for robust network design
2011 Buchheim, C.; Liers, F.; Sanita, Laura.
An improved LP-based approximation for steiner tree
2010 Byrka, J.; Grandoni, F.; Rothvoss, T.; Sanita, Laura.
An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree
2013 Konemann, J.; Sadeghian, S.; Sanita, Laura.
Approximate Deadline-Scheduling with precedence constraints
2015 Efsandiari, H.; Hajiaghyi, M. T.; Konemann, J.; Mahini, H.; Malec, D.; Sanita', Laura
Approximating weighted tree augmentation via Chvátal-Gomory cuts
2018 Fiorini, S.; Gross, M.; Konemann, J.; Sanita, Laura.
Better approximation algorithms for technology diffusion
2013 Konemann, J.; Sadeghian, S.; Sanita', Laura
Exponentiality of the exchange algorithm for finding another room-partitioning
2014 Edmonds, J.; Sanita', Laura
Fast approximation algorithms for the generalized survivable network design problem
2016 Feldmann, A. E.; Konemann, J.; Pashkovich, K.; Sanita', Laura
Finding small stabilizers for unstable graphs
2014 Bock, A.; Chandrasekaran, K.; Konemann, J.; Peis, B.; Sanita', Laura
Finding small stabilizers for unstable graphs
2015 Bock, A.; Chandrasekaran, K.; Konemann, J.; Peis, B.; Sanita, Laura.
Finding the closest ultrametric
2015 Di Summa, M.; Pritchard, D.; Sanita', Laura
From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk
2011 Grandoni, F.; Rothvoss, T.; Sanita, Laura.
Improved region-growing and combinatorial algorithms for κ-route cut problems
2015 Guruganesh, G.; Sanita', Laura; Swamy, C.
Integer programming and combinatorial optimization : 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings
2022 Aardal, Karen; Sanita', Laura
Lehman's theorem and the directed Steiner tree problem
2016 Abdi, A.; Feldmann, A. E.; Guenin, B.; Konemann, J.; Sanita', Laura
| Titolo | Data di pubblicazione | Autore(i) | Rivista | Editore |
|---|---|---|---|---|
| 0/1 Polytopes with quadratic Chvátal rank | 1-gen-2013 | Rothvoss, T.; Sanita, Laura. | - | (seleziona...) |
| 0/1 polytopes with quadratic Chvátal rank | 1-gen-2017 | Rothvoss, T.; Sanita, Laura. | OPERATIONS RESEARCH | - |
| Algorithms for inverse optimization problems | 1-gen-2018 | Ahmadian, S.; Bhaskar, U.; Sanita', Laura; Swamy, C. | - | (seleziona...) |
| An efficient characterization of submodular spanning tree games | 1-gen-2020 | Koh, Zhuan Khye; Sanita', Laura | MATHEMATICAL PROGRAMMING | - |
| An Efficient Characterization of Submodular Spanning Tree Games | 1-gen-2019 | Koh, Z. K.; Sanita', Laura | - | (seleziona...) |
| An exact algorithm for robust network design | 1-gen-2011 | Buchheim, C.; Liers, F.; Sanita, Laura. | - | (seleziona...) |
| An improved LP-based approximation for steiner tree | 1-gen-2010 | Byrka, J.; Grandoni, F.; Rothvoss, T.; Sanita, Laura. | - | (seleziona...) |
| An LMP O(log n)-approximation algorithm for nodeweighted prize collecting steiner tree | 1-gen-2013 | Konemann, J.; Sadeghian, S.; Sanita, Laura. | - | (seleziona...) |
| Approximate Deadline-Scheduling with precedence constraints | 1-gen-2015 | Efsandiari, H.; Hajiaghyi, M. T.; Konemann, J.; Mahini, H.; Malec, D.; Sanita', Laura | - | (seleziona...) |
| Approximating weighted tree augmentation via Chvátal-Gomory cuts | 1-gen-2018 | Fiorini, S.; Gross, M.; Konemann, J.; Sanita, Laura. | - | Association for Computing Machinery |
| Better approximation algorithms for technology diffusion | 1-gen-2013 | Konemann, J.; Sadeghian, S.; Sanita', Laura | - | (seleziona...) |
| Exponentiality of the exchange algorithm for finding another room-partitioning | 1-gen-2014 | Edmonds, J.; Sanita', Laura | DISCRETE APPLIED MATHEMATICS | - |
| Fast approximation algorithms for the generalized survivable network design problem | 1-gen-2016 | Feldmann, A. E.; Konemann, J.; Pashkovich, K.; Sanita', Laura | - | (seleziona...) |
| Finding small stabilizers for unstable graphs | 1-gen-2014 | Bock, A.; Chandrasekaran, K.; Konemann, J.; Peis, B.; Sanita', Laura | - | (seleziona...) |
| Finding small stabilizers for unstable graphs | 1-gen-2015 | Bock, A.; Chandrasekaran, K.; Konemann, J.; Peis, B.; Sanita, Laura. | MATHEMATICAL PROGRAMMING | - |
| Finding the closest ultrametric | 1-gen-2015 | Di Summa, M.; Pritchard, D.; Sanita', Laura | DISCRETE APPLIED MATHEMATICS | - |
| From uncertainty to nonlinearity: Solving virtual private network via single-sink buy-at-bulk | 1-gen-2011 | Grandoni, F.; Rothvoss, T.; Sanita, Laura. | MATHEMATICS OF OPERATIONS RESEARCH | - |
| Improved region-growing and combinatorial algorithms for κ-route cut problems | 1-gen-2015 | Guruganesh, G.; Sanita', Laura; Swamy, C. | - | Association for Computing Machinery |
| Integer programming and combinatorial optimization : 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings | 1-gen-2022 | Aardal, Karen; Sanita', Laura | - | Springer |
| Lehman's theorem and the directed Steiner tree problem | 1-gen-2016 | Abdi, A.; Feldmann, A. E.; Guenin, B.; Konemann, J.; Sanita', Laura | SIAM JOURNAL ON DISCRETE MATHEMATICS | - |