7129 search results - page 168 / 1426 » Approximation Algorithms for Treewidth |
136
Voted
MOR
2000
15 years 3 months ago
2000
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
116
click to vote
COMGEO
2010
ACM
15 years 3 months ago
2010
ACM
We present the IteratedTverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S Rd with running time subexponential in d. The alg...
118
click to vote
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...
127
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
127
Voted
ICA
2004
Springer
15 years 9 months ago
2004
Springer
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...