𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Color constrained combinatorial optimization problems

✍ Scribed by Horst W. Hamacher; Franz Rendl

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
408 KB
Volume
10
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On simple combinatorial optimization pro
On simple combinatorial optimization problems
✍ A.J. Hoffman πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.