Networks Research Group
Networks Research Group
Tour
People
Project
Publications
News
Events
Contact
Randomized Rounding Techniques
Approximation algorithms for survivable multicommodity flow problems with applications to network design
Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and …
Ajay Todimala
,
Byrav Ramamurthy
Cite
URL
Cite
×