A fast parametric submodular intersection algorithm for strong map sequences

Mathematics of Operations Research

Volumn 22, Issue 4, 1997, Pages 803-813

  Iwata, Satoru ^a   Murota, Kazuo ^b   Shigeno, Maiko ^c  

^a OSAKA UNIVERSITY   (Japan)

^b KYOTO UNIVERSITY   (Japan)

^c UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Algorithm; Strong map; Submodular system

Indexed keywords

NUMERICAL METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING;

FAST PARAMETRIC SUBMODULAR INTERSECTION ALGORITHMS; GALLO GRIGORIADIS TARJAN (GGT) METHOD; SUBMODULAR SYSTEMS;

ALGORITHMS;

EID: 0031276077     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.22.4.803     Document Type: Article

References (39)

1. Àhuja, R. K., T. L. Magnanti, J. B. Orlin (1993). Network Flows - Theory, Algorithms, and Applications, Prentice Hall.
2. Brown, J. R. (1979). The sharing problem. Oper. Res. 27 324-340.
3. Cheng, E., W. H. Cunningham (1994). A faster algorithm for computing the strength of a network. Inform. Process. Lett. 49 209-212.
4. Crapo, H. H. (1965). Single-element extensions of matroids. J. Res. Nat. Bur. Standards 69B 55-65.
5. _ (1967). Structure theory for geometric lattices. Rend. Sem. Mat. Univ. Padova 38 14-22.
6. Cunningham, W. H. (1985). Optimal attack and reinforcement of a network. J. ACM 32 549-561.
7. Dinkelbach, W. (1967). On nonlinear fractional programming. Management Sci. 13 492-498.
8. Edmonds, J. (1970). Submodular functions, matroids, and certain polyhedra. R. Guy, H. Hanai, N. Sauer, J. Schönheim, eds., Combinatorial Structures and Their Applications, Gordon and Breach, 69-87.
9. _, R. Giles (1977). A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1 185-204.
10. Frank, A. (1981). Generalized polymatroids. A. Hajnal, L. Lovász, V. T. Sós, eds. Finite and Infinite Sets, North-Holland, 285-294.
11. _ (1984). Finding feasible vectors of Edmonds-Giles polyhedra. J. Combin. Theory Ser. B 36 221-239.
12. _, E. Tardos (1988). Generalized polymatroids and submodular flows. Math. Programming 42 489-563.
13. Fujishige, S. (1978). Algorithms for solving the independent-flow problems. J. Oper. Res. Soc. Japan 21 189-204.
14. _ (1980a). Lexicographically optimal base of a polymatroid with respect to a weight vector. Math. Oper. Res. 5 186-196.
15. _ (1980b). Principal structures of submodular systems. Discrete Appl. Math. 2 77-79.
16. _ (1991). Submodular Functions and Optimization, North-Holland.
17. _, N. Tomizawa (1983). A note on submodular functions on distributive lattices. J. Oper. Res. Soc. Japan 26 309-318.
18. _, X. Zhang (1992). New algorithms for the intersection problem of submodular systems. Japan. J. Indust. Appl. Math. 9 369-382.
19. Gabow, H. (1995). Algorithms for graphic polymatroids and parametric s-sets. Proceedings of the 6th ACMI SIAM Symposium on Discrete Algorithms, 88-97.
20. Gallo, G., M. D. Grigoriadis, R. E. Tarjan (1989). A fast parametric network flow algorithm and applications. SIAM J. Comput. 18 30-55.
21. Goldberg, A. V., R. E. Tarjan (1988). A new approach to the maximum flow problem. J. ACM 35 921-940.
22. Gondran, M., M. Minoux (1984). Graphs and Algorithms, John Wiley.
23. Gusfield, D. (1991). Computing the strength of a graph. SIAM J. Comput. 20 639-654.
24. _, C. U. Martel (1992). A fast algorithm for the generalized parametric minimum cut problem and applications. Algorithmica 7 499-519.
25. _, É. Tardos (1994). A faster parametric minimum-cut algorithm. Algorithmica 11 278-290.
26. Hassin, R. (1982). Minimum cost flow with set-constraints. Networks 12 1-21.
27. Higgs, D. A. (1968). Strong maps of geometries. J. Combin. Theory 5 185-191.
28. Ichimori, T., H. Ishii, T. Nishida (1982). Optimal sharing. Math. Programming 23 341-348.
29. Kung, J. (1978). Bimatroids and invariants. Adv. Math. 30 238-249.
30. _ (1986). Strong maps. N. White, ed., Theory of Matroids, Cambridge University Press, 224-253.
31. Lawler, E. L., C. U. Martel (1982). Computing maximal polymatroidal network flows. Math. Oper. Res. 7 334-347.
32. McCormick, S. T. (1996). Fast algorithms for parametric scheduling come from extensions to parametric max-imum flow, Proceedings of the 28th ACM Symposium on Theory of Computing, 319-328.
33. Megiddo, N. (1974). Optimal flows in networks with multiple sources and sinks. Math. Programming 7 97-107.
34. Murota, K. (1989). Combinatorial dynamical system theory: general framework and controllability criteria. Discrete Appl. Math. 22 241-265.
35. _ (1990). Eigensets and power products of a bimatroid. Adv. Math. 80 78-91.
36. Schrijver, A. (1979). Matroids and linking systems. J. Combin. Theory Ser. B 26 349-369.
37. Tardos, É., C. A. Tovey, M. A. Trick (1986). Layered augmenting path algorithms. Math. Oper. Res. 11 362-370.
38. Topkis, D. M. (1978). Minimizing a submodular function on a lattice. Oper. Res. 26 305-321.
39. Welsh, D. J. A. (1976). Matroid Theory, Academic Press, New York.