1279 search results - page 26 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
112
Voted
GECCO
2007
Springer
15 years 7 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
117
click to vote
RECOMB
2010
Springer
15 years 1 days ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
127
click to vote
STOC
1998
ACM
15 years 5 months ago
1998
ACM
In the k-median problem we are given a set S of n points in a metric space and a positive integer k. We desire to locate k medians in space, such that the sum of the distances fro...
125
click to vote
ESA
2003
Springer
15 years 6 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 ...