5595 search results - page 93 / 1119 » Approximation Algorithms for Clustering Problems |
159
click to vote
APPROX
2007
Springer
15 years 11 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
152
click to vote
ESA
2003
Springer
15 years 10 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
177
click to vote
IPCO
1998
15 years 6 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
153
click to vote
UAI
2004
15 years 6 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
133
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...