1647 search results - page 50 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
143
click to vote
FOCS
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
132
click to vote
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....
152
click to vote
IPCO
1998
15 years 3 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 ...
124
click to vote
GBRPR
2005
Springer
15 years 8 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
109
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We generalize the k-means algorithm presented by the authors [14] and show that the resulting algorithm can solve a larger class of clustering problems that satisfy certa...