260 search results - page 2 / 52 » A Linear Time Approximation Algorithm for Ruler Folding Prob... |
WADS
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
ICALP
2005
Springer
13 years 11 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...
ALGORITHMICA
2005
13 years 5 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
LATIN
2000
Springer
13 years 9 months ago
2000
Springer
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
WADS
2005
Springer
13 years 10 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...