5595 search results - page 101 / 1119 » Approximation Algorithms for Clustering Problems |
143
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We address the problem of approximating the 2-Interval Pattern problem over its various models and restrictions. This problem, which is motivated by RNA secondary structure predict...
124
click to vote
IPL
2002
15 years 4 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...
144
click to vote
JMLR
2010
14 years 11 months 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...
141
click to vote
ESA
2006
Springer
15 years 8 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...
140
click to vote
COCOON
2003
Springer
15 years 10 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...