|
|
|
|
|
András Faragó and Zohre R. Mojaveri
The Disjoint Connecting Paths problem and its capacitated generalization, called Unsplittable Flow problem, play an important role in practical applications such as communication network design and routing. These tasks are NP-hard in general, but various...
ver más
|
|
|
|
|