A long-standing conjecture for the traveling salesman problem (TSP) stat...
We design online algorithms for the fair allocation of public goods to a...
The symmetric circulant TSP is a special case of the traveling salesman
...
We study the two-stage vertex-weighted online bipartite matching problem...
We study the problem of finding flows in undirected graphs so as to mini...
Over the last two decades, a significant line of work in theoretical
alg...
We consider the problem of allocating a set of divisible goods to N agen...
In this paper, we consider the online vertex-weighted bipartite matching...