Learn More

An instance of the sorting buffer problem consists of a sequence of requests for service each of which is specified by a point in a metric space (V, d), where V is a set of points and d is a distance function, a server which moves from point to point in order to serve these requests, and a finite-capacity sorting buffer capable of storing up to k requests.… (More)

- ‹
- 1
- ›