@article {15250,
	title = {Approximation algorithms for channel allocation problems in broadcast networks},
	journal = {Networks},
	volume = {47},
	year = {2006},
	month = {2006/03/09/},
	pages = {225 - 236},
	abstract = {We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems considered have the property that the space occupied by a collection of objects together could be significantly less than the sum of the sizes of the individual objects. In the Channel Allocation Problem, there are requests that are subsets of topics. There are a fixed number of channels that can carry an arbitrary number of topics. All the topics of each request must be broadcast on some channel. The load on any channel is the number of topics that are broadcast on that channel; the objective is to minimize the maximum load on any channel. We present approximation algorithms for this problem, and also show that the problem is MAX-SNP hard. The second problem is the Edge Partitioning Problem addressed by Goldschmidt, Hochbaum, Levin, and Olinick (Networks, 41:13{\textendash}23, 2003). Each channel here can deliver topics for at most k requests, and we aim to minimize the total load on all channels. We present an O(n1/3){\textendash}approximation algorithm, and also show that the algorithm can be made fully distributed with the same approximation guarantee; we also generalize the (nondistributed) Edge Partitioning Problem of graphs to the case of hypergraphs. {\textcopyright} 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 47(4), 225{\textendash}236 2006},
	keywords = {channel allocation problem, distributed approximation algorithm, edge partitioning problem},
	isbn = {1097-0037},
	doi = {10.1002/net.20111},
	url = {http://onlinelibrary.wiley.com/doi/10.1002/net.20111/abstract},
	author = {Gandhi,Rajiv and Khuller, Samir and Srinivasan, Aravind and Wang,Nan}
}
