Sander Borst

According to our database, Sander Borst authored at least 8 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

To buy or not to buy: deterministic rent-or-buy problems on node-weighted graphs.

Sander Borst, Moritz Venzin

CoRR, July, 2025

A nearly optimal randomized algorithm for explorable heap selection.

Sander Borst, Daniel Dadush, Sophie Huiberts, Danish Kashaev

Math. Program., March, 2025

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems.

Sander Borst, Marek Eliás, Moritz Venzin

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

Online Matching on 3-Uniform Hypergraphs.

Sander Borst, Danish Kashaev, Zhuan Khye Koh

Proceedings of the Integer Programming and Combinatorial Optimization, 2025

2023

On the integrality gap of binary integer programs with Gaussian data.

Sander Borst, Daniel Dadush, Sophie Huiberts, Samarth Tiwari

Math. Program., February, 2023

Integrality Gaps for Random Integer Programs via Discrepancy.

Sander Borst, Daniel Dadush, Dan Mikulincer

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees.

Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk

Algorithmica, 2022

2021

Majorizing Measures for the Optimizer.

Sander Borst, Daniel Dadush, Neil Olver, Makrand Sinha

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021