𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximum congested cut problem and its robust counterpart: Exact and approximation algorithms for the single and the multicommodity case

✍ Scribed by Maria G. Scutellà


Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
178 KB
Volume
51
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.