SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Implementing approximation algorithms for the single-source unsplittable flow problem
Journal of Experimental Algorithmics (JEA)
Joint resource conserving and load distributing approaches for routing of survivable connections
Computer Communications
On the approximability of the minimum congestion unsplittable shortest path routing problem
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Hi-index | 0.00 |
For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...