6 citations · 25 across the 31 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
Sungjin Im, Janardhan Kulkarni, Kamesh Munagala +1
We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \emph{non-clairvoyant} setting. In this problem, a set of jobs …
cs.DS2014★ 2 cited
Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
Ravishankar Krishnaswamy, Viswanath Nagarajan, Kirk Pruhs +1
We consider the following node-capacitated network design problem. The input is an undirected graph, set of demands, uniform node capacity and arbitrary node costs. The goal is to…