630 search results - page 46 / 126 » Hardness results for approximating the bandwidth |
104
Voted
ICALP
2009
Springer
16 years 25 days ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
90
Voted
TIT
2008
15 years 13 days ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
109
click to vote
INFOCOM
2002
IEEE
15 years 5 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...
129
Voted
IPSN
2009
Springer
15 years 7 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
136
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...