Sander Borst

Full Name

S.J. Borst

Email

Sander.Borst@cwi.nl

Phone

+31 20 592 4093

Room

M239

Department(s)

Networks and Optimization

Function(s)

PhD student

Homepage

https://sanderborst.nl

Sander Borst

Borst, S., Dadush, D., Huiberts, S., & Kashaev, D. (2023). A nearly optimal randomized algorithm for explorable heap selection. In Proceedings of the 24th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2023 (pp. 29–43). doi:10.1007/978-3-031-32726-1_3
Borst, S., Dadush, D., & Mikulincer, D. (2023). Integrality gaps for random integer programs via discrepancy. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1692–1733). doi:10.1137/1.9781611977554.ch65
Ber, A., Borst, M., Borst, S., & Sukochev, F. (2023). A solution to the multidimensional additive homological equation. Izvestiya Mathematics, 87(2), 201–251. doi:10.4213/im9319e
Borst, S., van Iersel, L., Jones, M., & Kelk, S. (2022). New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. Algorithmica, 84, 2050–2087. doi:10.1007/s00453-022-00946-8
Borst, S., Dadush, D., Huiberts, S., & Tiwari, S. (2021). On the integrality gap of binary integer programs with Gaussian data. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 427–442). doi:10.1007/978-3-030-73879-2_30
Borst, S., Dadush, D., Olver, N., & Sinha, M. (2021). Majorizing measures for the optimizer. In 12th Innovations in Theoretical Computer Science Conference, ITCS 2021 (pp. 73:1–73:20). doi:10.4230/LIPIcs.ITCS.2021.73

Towards a Quantitative Theory of Integer Programming (QIP)