𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation schemes for the Min-Max Starting Time Problem

✍ Scribed by Leah Epstein; Tamir Tassa

Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
193 KB
Volume
40
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation results for min-max path c
Approximation results for min-max path cover problems in vehicle routing
✍ Zhou Xu; Liang Xu; Chung-Lun Li πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 410 KB

## Abstract This article studies a min‐max path cover problem, which is to determine a set of paths for __k__ capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when

Polynomial time approximation schemes fo
Polynomial time approximation schemes for class-constrained packing problems
✍ Hadas Shachnai; Tami Tamir πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can