15033 search results - page 107 / 3007 » Complexity Theory and Algorithms |
COCO
1989
Springer
15 years 7 months ago
1989
Springer
120
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
101
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The tendency of semidefinite programs to compose perfectly under product has been exploited many times in complexity theory: for example, by Lov
102
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
140
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...