3894 search results - page 63 / 779 » Approximation Algorithms for Biclustering Problems |
145
click to vote
IPL
2002
15 years 5 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
158
click to vote
JMLR
2010
15 years 28 days ago
2010
The Uncapacitated Facility Location Problem (UFLP) is one of the most widely studied discrete location problems, whose applications arise in a variety of settings. We tackle the U...
152
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
160
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
146
click to vote
AUSAI
2004
Springer
15 years 11 months ago
2004
Springer
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...