This paper revisits the 2-approximation algorithm for k-MST presented by...
A long-standing conjecture for the traveling salesman problem (TSP) stat...
The Simplex algorithm for solving linear programs-one of Computing in Sc...
The symmetric circulant TSP is a special case of the traveling salesman
...
This paper considers the interplay between semidefinite programming, mat...
We study the problem of finding flows in undirected graphs so as to mini...
Facet-defining inequalities of the symmetric Traveling Salesman Problem ...
Over the last two decades, a significant line of work in theoretical
alg...
In this note, we revisit the recursive random contraction algorithm of K...
In this paper, we consider the online vertex-weighted bipartite matching...
Combinatorial optimization algorithms for graph problems are usually des...
In this note, we consider the capacitated facility location problem when...
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...
The traveling salesman problem (TSP) is a fundamental problem in
combina...
The Weighted Tree Augmentation problem (WTAP) is a fundamental problem i...
We consider the integrality gap of the subtour LP relaxation of the Trav...
We study a semidefinite programming relaxation of the traveling salesman...