3874 search results - page 54 / 775 » Approximation Algorithms for k-hurdle Problems |
FCT
2005
Springer
15 years 3 months ago
2005
Springer
Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is N...
ISAAC
2000
Springer
15 years 1 months ago
2000
Springer
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a number m of machines, we study the problem of selecting a maximum weight subset of th...
102
click to vote
ALGORITHMICA
2006
14 years 9 months ago
2006
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
ICCSA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...