4 papers
A Polynomial-Time Algorithm for the Next-to-Shortest Path Problem on Positively Weighted Directed Graphs
Kuowen Chen, Nicole Wein, Yiran Zhang
Given a graph and a pair of terminals , , the next-to-shortest path problem asks for an (simple) path that is shortest among all not shortest paths…
Contention Resolution, With and Without a Global Clock
Zixi Cai, Kuowen Chen, Shengquan Du +3
In the Contention Resolution problem parties each wish to have exclusive use of a shared resource for one unit of time. The problem has been studied since the early 1970s, unde…
The Squishy Grid Problem
Zixi Cai, Kuowen Chen, Shengquan Du +3
In this paper we consider the problem of approximating Euclidean distances by the infinite integer grid graph. Although the topology of the graph is fixed, we have control over the…
New Results on a General Class of Minimum Norm Optimization Problems
Kuowen Chen, Jian Li, Yuval Rabani +1
We study the general norm optimization for combinatorial problems, initiated by Chakrabarty and Swamy (STOC 2019). We propose a general formulation that captures a large class of c…