630 search results - page 61 / 126 » Hardness results for approximating the bandwidth |
90
Voted
MOBICOM
2010
ACM
15 years 24 days ago
2010
ACM
While the cellular revolution has made voice connectivity ubiquitous in the developing world, data services are largely absent or are prohibitively expensive. In this paper, we pr...
114
click to vote
COMPGEOM
2008
ACM
15 years 2 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
113
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
106
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
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...
83
Voted
INFOCOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...