7150 search results - page 120 / 1430 » An Approximation Algorithm for Approximation Rank |
189
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...
152
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
204
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...