J. M Kleinburg, Single source unsplittable flow, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 68--77.  Home/Search   Document Not in Database   Summary   Related Articles

.... 100 500. As a result, much of the existing research in network design proved less applicable than we had hoped. In particular, the SAN fabric design problem generalizes and extends several NP hard problems in network design. For example, it generalizes the nonbifurcated network loading problem [21, 6, 3, 16, 17]. In this problem, there are several commodities, each with an origin and destination node in the network, and a required amount of the commodity that must travel through the network between these nodes. One must choose a minimum cost set of capacitated links connecting a known set of nodes to ....

....known to be NP complete, in which one must find the minimum cost set of links to connect a given subset of the nodes in a network. See [23] for a survey of work on the Steiner tree problem. The nonbifurcated network loading problem is NP hard even when all commodities share a single source [21]. If we relax the constraint that flows cannot be split, the SAN design problem generalizes the multicommodity network design problem [20, 8, 7, 19, 22, 10, 5] This problem is known to be NP hard even in the single commodity case [15] Like the nonbifurcated network loading problem, it involves ....

J. M Kleinburg, Single source unsplittable flow, Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, 1996, pp. 68--77.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC