2957 search results - page 308 / 592 » The Complexity of Polynomial-Time Approximation |
173
click to vote
GLOBECOM
2007
IEEE
16 years 29 days ago
2007
IEEE
—Comprehensive performance analysis of the unordered V-BLAST algorithm with various power allocation strategies is presented, which makes use of analytical tools and resorts to M...
141
click to vote
COCO
2005
Springer
16 years 5 days ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...
149
click to vote
ICALP
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
184
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
216
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...