Algorithms for graphic polymatroids and parametric s-sets in memory of Eugene L. Lawler

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1995, Pages 88-97

  Gabow, Harold N ^a  

^a UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; GLOBAL OPTIMIZATION;

COVERING NUMBERS; FLOW ALGORITHM; FLOW TECHNIQUES; FRACTIONAL PACKING; GLOBAL MINIMA; MAXIMUM FLOWS; MINIMUM COST; UNDIRECTED GRAPH;

PARAMETER ESTIMATION;

EID: 0041110819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. R. K. Ahuja, J. B. Orlin, C. Stein and R. E. Tarjan, Improved algorithms for bipartite network flow, SIAM J. Comput., 23, 5 (1994), pp. 906-933.
2. P. Barahona, Separating from the dominant of the spanning tree polytope, Op. Res. Letters, 12 (1992), pp. 201-203.
3. S. Baum and L. E. Trotter, Jr., Integer rounding for polymatroid and branching optimization problems, SIAM J. Alg. Disc. Meth., 2, 4 (1981), pp. 416-425.
4. E. Cheng and W. H. Cunningham, A faster algorithm for computing the strength of a network, Inf. Proc. Letters, 49 (1994), pp. 209-212.
5. W. H. Cunningham, Optimal attack and reinforcement of a network, J. ACM, 32, 3 (1985), pp. 549-561.
6. -, Minimum cuts, modular functions and matroid polyhedra, Networks, 15 (1985), pp. 205-215.
7. W. Dinkelbach, On nonlinear fractional programming, Management Sci., 13 (1967), pp. 492-498.
8. J. Edmonds, Lehman's switching game and a theorem of Tutte and Nash-Williams, J. Res. National Bureau of Standards, 69B (1965), pp. 73-77.
9. -, Submodular functions, matroids, and certain polyhedra in Calgary International Conf. on Combinatorial Structures and their Applications, Gordon and Breach, New York, 1969, pp. 69-87.
10. H. N. Gabow, A matroid approach to finding edge connectivity and packing arborescences, Proc. 23rd Annual ACM Symp. on Theory of Comp. (1991), pp. 112-122; J. CSS, to appear.
11. -, Efficient splitting off algorithms for graphs, Proc. 26th Annual ACM Symp. on Theory of Comp. (1994), pp. 696-705.
12. H. N. Gabow and K. S. Manu, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, preprint.
13. H. N. Gabow and H. H. Westermann, Forests, frames and games: Algorithms for matroid sums and applications, Algorithmica, 7 (1992), pp. 465-497.
14. G. Gallo, M. D. Grigoriadis and R. E. Tarjan, A fast parametric maximum flow algorithm and applications, SIAM J. Comput., 18, 1 (1989), pp. 30-55.
15. F. R. Giles, Submodular functions, graphs and integer polyhedra, Ph. D. Dissertation, Dept. of Combinatorics and Optimization, Univ. of Waterloo, Waterloo, Ontario, 1975.
16. A. V. Goldberg and R. E. Tarjan, A new approach to the maximum flow-problem, J. ACM, 35, 4 (1988), pp. 921-940.
17. D. Gusfield, Connectivity and edge-disjoint spanning trees, Inf. Proc. Letters, 16, 2 (1983), pp. 87-89.
18. -, Computing the strength of a graph, SIAM J. Comput., 20, 4 (1991), pp. 639-654.
19. J. Hao and J. B. Orlin, A faster algorithm for finding the minimum cut in a graph, Proc. 3rd Annual ACM-SIAM Symp. on Disc. Algorithms (1992), pp. 165-174.
20. F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1969.
21. M. W. Padberg and L. A. Wolsey, Trees and cuts, Ann. Discrete Math., 17 (1983), pp. 511-517.
22. -, Fractional covers for forests and matchings, Math. Programming, 29 (1984), pp. 1-14.
23. S. Phillips and J. Westbrook, Online load balancing and network flow, Proc. 25th Annual ACM Symp. on Theory of Comp. (1993), pp. 402-411.
24. J.-C. Picard and M. Queyranne, A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory, Networks, 12 (1982), pp. 141-159.
25. -, Selected applications of minimum cuts in networks, INFOR, 20 (1982), pp. 394-422.
26. S. Schaible, Fractional programming II. On Dinkel-bach's algorithm, Management Sci., 22 (1976), pp. 868873.
27. Matroid Theory, Academic Press, New York, 1976.