Sciweavers

22 search results - page 5 / 5
» Optimal Broadcast Domination of Arbitrary Graphs in Polynomi...
Sort
View
INFOCOM
2008
IEEE
14 years 5 days ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
ICALP
2010
Springer
13 years 10 months ago
On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
Venkatesan Guruswami, Rishi Saket