Minimum k arborescences with bandwidth constraints

Algorithmica (New York)

Volumn 38, Issue 4, 2004, Pages 529-537

  Cai, Mao Cheng ^a   Deng, Xiaotie ^b   Wang, Lusheng ^a  

^a INSTITUTE OF SYSTEMS SCIENCE   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithm and complexity; Arborescence; Digraph; Matroid; Maximum flow; Polymatroid; Polymatroid intersection

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

ALGORITHM AND COMPLEXITY; ARBORESCENCE; DIGRAPH; MATROID; MAXIMUM FLOW; POLYMATROID; POLYMATROID INTERSECTION;

ALGORITHMS;

EID: 21044448834     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1054-1     Document Type: Article

References (17)

1. R.K. Ahuja, T.L. MaGnanit and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. M.H. Ammar, S.Y. Cheung, and C.M. Scoglio, Routing multipoint connections using virtual paths in an ATM network, Proc. IEEE INFOCOM '93, pp. 98-105, 1993.
3. F. Bauer and A. Vanna, Distributed algorithms for multicast path setup in data networks, IEEE/ACM Trans. Networking, 4 (1996), 181-191.
4. K. Bharath-Kumar and J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun. COM-31 (1983), 343-351.
5. S.E. Deering and D.R. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Trans. Comput. Systems, 8 (1990), 85-110.
6. J. Edmonds, Minimum partition of a matroid into independent subsets, J. Res. Nat. Bur. Standards, 69B (1965), 67-72.
7. J. Edmonds, Edge-disjoint branchings, in: Combinatorial Algorithm (R. Rustin, ed.), Academic Press, New York, 1973, pp. 91-96.
8. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, 1962.
9. A. Frank, Kernel systems of digraphs, Acta Sci. Math. (Szeged), 41(1979), 63-76.
10. A. Frank, A weighted matroid intersection algorithm, J. Algorithms, 2 (1981), 328-336.
11. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
12. X. Jia and L. Wang, A group multicast routing algorithm by using multiple minimum Steiner trees. Comput. Commun., 20 (1997), 750-758.
13. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart, & Winston, New York, 1975.
14. L. Lovász, On two minimax theorems in graph theory, J. Combin. Theory Ser. B, 21 (1976), 96-103.
15. B. Ma and L. Wang, On the inapproximability of disjoint paths and minimum Steiner forest with bandwidth constraints, J. Comput. System Sci., 60 (2000), 1-12.
16. C. McDiarmid, Blocking, Antiblocking and pairs of matroids and polymatroids, J. Combin. Theory Ser. B, 25 (1978), 313-325.
17. J. Moy, Multicast routing extensions for OSPF, Comm. ACM, 37 (1994). 61-66.