Sander Borst

We give an algorithmic proof of the majorizing measures theorem based on two parts: We make the simple (but apparently new) observation that finding the best majorizing measure can be cast as a convex program. Expand

We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. Expand

We prove that, with high probability, the integrality gap IPGAP is small, i.e., it depends only polynomially on $m$ instead of exponentially. Expand