94 search results - page 5 / 19 » Genericity, Randomness, and Polynomial-Time Approximations |
SODA
2004
ACM
13 years 10 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
FOCS
2007
IEEE
14 years 3 months ago
2007
IEEE
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
WEA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Extensions of the randomized tournaments techniques introduced in [6, 7] to approximate solutions of 1-median and diameter computation of finite subsets of general metri...
FOCS
1992
IEEE
14 years 26 days ago
1992
IEEE
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...