Efficient algorithms for Index Coding

The index coding problem has attracted a considerable amount of attention in recent years. The problem is motivated by several applications in wireless networking and distributed computing, including wireless architectures that utilize network coding and opportunistic listening. In this paper, we propose efficient exact and heuristic solutions for this problem. Our numerical study shows that exact solutions can be efficiently obtained for small instances of the problem, while heuristic solutions with low computation time can achieve near-optimal performance for large instances.