𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithms — ESA 2002 Volume 2461 || New Heuristics and Lower Bounds for the Min-Max k-Chinese Postman Problem

✍ Scribed by Möhring, Rolf; Raman, Rajeev


Book ID
120930810
Publisher
Springer Berlin Heidelberg
Year
2002
Weight
189 KB
Category
Article
ISBN
3540457496

No coin nor oath required. For personal study only.