3894 search results - page 57 / 779 » Approximation Algorithms for Biclustering Problems |
172
click to vote
ESA
2003
Springer
15 years 11 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 ...
207
click to vote
IPCO
1998
15 years 7 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
SODA
2008
ACM
15 years 7 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...
171
click to vote
WADS
2007
Springer
16 years 3 days ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
143
click to vote
WADS
2007
Springer
16 years 3 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...