518 search results - page 3 / 104 » Beating a Random Assignment |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper studies the problem of exact localization of multiple objects with noisy data. The crux of the proposed approach consists of random illumination. Two recovery methods ar...
ECUMN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We propose three routing strategies for the routing and wavelength assignment (RWA) of scheduled and random lightpath demands in a wavelength-switching mesh network witho...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
The issue of transport capacity of a randomly deployed wireless network under random (c, f ) channel assignment was considered by us in [1]. We showed in [1] that when the number ...
119
click to vote
OL
2011
14 years 4 months ago
2011
We demonstrate that the Linear Multidimensional Assignment Problem with iid random costs is polynomially "-approximable almost surely (a. s.) via a simple greedy heuristic, f...
69
Voted
STOC
2002
ACM
15 years 9 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...