We study the Unsplittable Flow Problem (UFP) on a line graph, focusing on the long-standing open question of whether the problem is APX-hard. We describe a deterministic quasi-pol...
Nikhil Bansal, Amit Chakrabarti, Amir Epstein, Bar...
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...