3 papers
cs.DS2016
Lazy Local Search Meets Machine Scheduling
Chidambaram Annamalai
We study the restricted case of Scheduling on Unrelated Parallel Machines. In this problem, we are given a set of jobs with processing times and each job may be scheduled…
cs.DS2015
Finding Perfect Matchings in Bipartite Hypergraphs
Chidambaram Annamalai
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. T…
cs.DS2014
Combinatorial Algorithm for Restricted Max-Min Fair Allocation
Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
We study the basic allocation problem of assigning resources to players so as to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of hav…