Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 94-105

  Patkar, Sachin B ^a   Narayanan, H ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; REINFORCEMENT; SOFTWARE ENGINEERING;

EDGE-WEIGHTED GRAPH; LINEAR TIME; LOGARITHMIC TIME; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; REINFORCEMENT MATERIALS; SUBMODULAR FUNCTIONS;

GRAPH THEORY;

EID: 84947767181     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_7     Document Type: Conference Paper

References (19)

1. Barahona, F.: Separating from the dominant of spanning tree polytope, Oper. Res. Letters, vol. 12, 1992, pp.201-203.
2. Cheng, E. and Cunningham, W.: A faster algorithm for computing the strength of a network, Information Processing Letters, vol. 49, 1994, pp.209-212.
3. Cunningham, W.: Optimal attack and reinforcement of a network, JACM, vol. 32, no. 3, 1985, pp.549-561.
4. Dinkelbach, W.: On nonlinear fractional programming, Management Sci., vol. 13, 1967, pp.492-498.
5. Edmonds, J.: Submodular functions, matroids and certain polyhedra, Proc. Calgary Intl. conference on Combinatorial Structures, 1970, pp.69-87.
6. Fujishige, S.: Submodular Functions and Optimization, Annals of Discrete Mathematics, North Holland, 1991.
7. Gabow, H.N.: Algorithms for graphic polymatroids and parametric s-sets J. Algorithms, vol. 26, 1998, pp.48-86.
8. Gallo, G., Grigoriadis, M. and Tarjan, R.E.: A fast parametric network flow algorithm, SIAM J. of Computing, vol. 18, 1989, pp.30-55.
9. Gusfield, D.: Computing the strength of a graph, SIAM J. of Computing, vol. 20, 1991, pp.639-654.
10. Imai, H.: Network flow algorithms for lower truncated transversal polymatroids, J. of the Op. Research Society of Japan, vol. 26, 1983, pp. 186-210.
11. Iri, M. and Fujishige, S.: Use of matroid theory in operations research, circuits and systems theory, Int. J. Systems Sci.,vol. 12, no. 1, 1981, pp. 27-54.
12. Itai, A. and Rodeh, M.: The multi-tree approach to reliability in distributed networks, in Proc. 25th ann. symp. FOCS, 1984, pp. 137-147.
13. Narayanan, H.:Theory of matroids and network analysis, Ph.D. thesis, Department of Electrical Engineering, I.I.T. Bombay, 1974.
14. Narayanan, H.: The principal lattice of partitions of a submodular function, Linear Algebra and its Applications, 144, 1991, pp. 179-216.
15. Narayanan, H., Roy, S. and Patkar, S.B.: Approximation Algorithms for min-k-overlap Problems, using the Principal Lattice of Partitions Approach, J. of Algorithms, vol. 21, 1996, pp. 306-330.
16. Narayanan, H.: Submodular Functions and Electrical Networks, Annals of Discrete Mathematics-54, North Holland, 1997.
17. Patkar, S. and Narayanan, H.: Principal lattice of partitions of submodular functions on graphs: fast algorithms for principal partition and generic rigidity, in Proc. of the 3rd ann. Int. Symp. on Algorithms and Computation, (ISAAC), LNCS-650, Japan, 1992, pp. 41-50.
18. Patkar, S. and Narayanan, H.: Fast On-line/Off-line Algorithms for Optimal Reinforcement of a Network and its Connections with Principal Partition, Technical Report, Industrial Mathematics Group, Department of Mathematics, IIT Bombay, available from authors via e-mail, 2000.
19. Tomizawa, N.: Strongly irreducible matroids and principal partition of a matroid into strongly irreducible minors (in Japanese), Transactions of the Institute of Electronics and Communication Engineers of Japan, vol. J59A, 1976, pp. 83-91.