
A Combinatorial CutBased Algorithm for Solving Laplacian Linear Systems
Over the last two decades, a significant line of work in theoretical alg...
read it

Recursive Random Contraction Revisited
In this note, we revisit the recursive random contraction algorithm of K...
read it

Improved Analysis of RANKING for Online VertexWeighted Bipartite Matching
In this paper, we consider the online vertexweighted bipartite matching...
read it

Learning to Solve Combinatorial Optimization Problems on RealWorld Graphs in Linear Time
Combinatorial optimization algorithms for graph problems are usually des...
read it

Easy Capacitated Facility Location Problems, with Connections to LotSizing
In this note, we consider the capacitated facility location problem when...
read it

Subtour Elimination Constraints Imply a MatrixTree Theorem SDP Constraint for the TSP
De Klerk, Pasechnik, and Sotirov give a semidefinite programming constra...
read it

Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps
The traveling salesman problem (TSP) is a fundamental problem in combina...
read it

Tight Bounds for Online Weighted Tree Augmentation
The Weighted Tree Augmentation problem (WTAP) is a fundamental problem i...
read it

Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem
We consider the integrality gap of the subtour LP relaxation of the Trav...
read it

The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem
We study a semidefinite programming relaxation of the traveling salesman...
read it
David P. Williamson
is this you? claim profile