4 papers · 1 filter
Non-Clairvoyant Scheduling is Hard Even for Trees
Kunal Agrawal, Owen Druzgal, Milind Prabhu +1
We study online scheduling of parallel jobs on identical processors to minimize maximum flow time. Each arriving job is represented by a directed acyclic graph (DAG) whose vert…
The Cube-Root Phenomenon in Online Carpooling
Nikhil Bansal, Milind Prabhu, Sahil Singla +1
We consider the online carpooling problem, where edges arrive online and must be oriented immediately while keeping the discrepancy between the indegree and outdegree at each verte…
Approximation Preserving Coresets
Milind Prabhu, Chris Schwiegelshohn, Sudarshan Shyam
Clustering in a big data setting is an intensively studied problem, with coresets emerging as one of the important paradigms in this line of work. Given a cost function $\text{cost…
Online Graph Balancing and the Power of Two Choices
Nikhil Bansal, Milind Prabhu, Sahil Singla +1
In the classic online graph balancing problem, edges arrive sequentially and must be oriented immediately upon arrival, to minimize the maximum in-degree. For adversarial arrivals,…