7150 search results - page 120 / 1430 » An Approximation Algorithm for Approximation Rank |
74
Voted
ESA
2004
Springer
15 years 8 months ago
2004
Springer
98
Voted
WABI
2004
Springer
15 years 8 months ago
2004
Springer
132
Voted
STOC
1998
ACM
15 years 6 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...
115
Voted
STOC
1994
ACM
15 years 6 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...
152
click to vote
INFOCOM
2010
IEEE
15 years 1 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...