Domination Between Traffic Matrices

References

• Applegate D., Cohen E. Making intra-domain routing robust to changing and uncertain traffic demands: Understanding fundamental tradeoffs. Proc. ACM SIGCOMM (2003) Karlsruhe, Germany:313–324Google Scholar
• Azar Y., Cohen E., Fiat A., Kaplan H., Räcke H. Optimal oblivious routing in polynomial time. J. Comput. System Sci. (2004) 69(3):383–394Crossref, Google Scholar
• Ben-Ameur W., Kerivin H. Routing of uncertain demands. Optim. Engrg. (2005) 3:283–313Crossref, Google Scholar
• Bertsimas D., Sim M. Robust discrete optimization and network flows. Math. Programming (2003) 98(1–3):49–71Crossref, Google Scholar
• Chekuri C., Oriolo G., Scutellá M. G., Shepherd F. B. Hardness of robust network design. (2005) 50(1):50–54[An extended abstact appeared in Proc. INOC, 2005, Lisbon, Portugal, 455–461.]Google Scholar
• Duffield N. G., Goyal P., Greenberg A. G., Mishra P. P., Ramakrishnan K. K., van der Merwe J. E. A flexible model for resource management in virtual private networks. Proc. ACM SIGCOMM (1999) Cambridge, MA:95–108Crossref, Google Scholar
• Eaves B. C., Freund R. M. Optimal scaling of balls and polyhedra. Math. Programming (1982) 23:138–147Crossref, Google Scholar
• Eisenbrand F., Grandoni F., Oriolo G., Skutella M. New approaches for virtual private network design. 32nd Proc. ICALP (2005) Lisbon, Portugal:1151–1162Crossref, Google Scholar
• Fingerhut J. A., Suri S., Turner J. S. Designing least-cost nonblocking broadband networks. J. Algorithms (1997) 24(2):287–309Crossref, Google Scholar
• Gupta A., Kleinberg J., Kumar A., Rastogi R., Yener B. Provisioning a virtual private network: A network design problem for multicommodity flow. 33rd Proc. STOC (2001) Heraklion, Crete, Greece:389–398Crossref, Google Scholar
• Iri M. On an extension of the max-flow min-cut theorem for multicommodity flows. J. Oper. Res. Soc. Japan (1970) 13:129–135Google Scholar
• Italiano G., Leonardi S., Oriolo G. Design of trees in the hose model: The balanced case. Oper. Res. Lett. (2006) 34(6):601–606Crossref, Google Scholar
• Kleinberg J. Single-source unsplittable flow. 37th Proc. FOCS (1996) Burlington, VT:68–77Crossref, Google Scholar
• Onaga K., Kakusho O. On feasibility conditions of multicommodity flows in networks. IEEE Trans. Circuit Theory (1970) 18(4):425–429Crossref, Google Scholar
• Oswald P., Shepherd F. B., Winzer P., Zirngibl M. Robust network design and selective randomized load balancing. 31st Proc. ECOC (2005) Glasgow, UK:1–23Google Scholar