research
∙
06/15/2018
A Polynomial-Time Algorithm for (2-2/k)-stable Instances of the k-terminal cut Problem
The k-terminal cut problem is defined on an edge-weighted graph with k d...
share
research
∙
06/15/2018
A Polynomial-Time Algorithm for 2-stable Instances of the k-terminal cut Problem
The k-terminal cut problem is defined on an edge-weighted graph with k d...
research
∙
05/17/2018
Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem
For the Asymmetric Traveling Salesman Problem (ATSP), it is known that t...
research
∙
05/05/2018
DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
This work presents the first algorithm for the problem of weighted onlin...
research
∙
05/05/2018
