480 search results - page 32 / 96 » Approximate and exact algorithms for the fixed-charge knapsa... |
WAOA
2005
Springer
14 years 2 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
ESA
1998
Springer
14 years 1 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
SMI
2008
IEEE
14 years 3 months ago
2008
IEEE
Abstract In this paper, we study the problem of approximate topological matching for quadrilateral meshes, that is, the problem of finding as large a set as possible of matching p...
VLDB
2002
ACM
13 years 8 months ago
2002
ACM
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
ICALP
2000
Springer
14 years 19 days ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...