Preview this item
Preview this item
Checking...

# Network flows and matching : first DIMACS implementation challenge

Author: David S Johnson; Catherine C McGeoch; DIMACS (Group) Providence, R.I. : American Mathematical Society, ©1993. DIMACS series in discrete mathematics and theoretical computer science, v. 12. Book : EnglishView all editions and formats WorldCat The DIMACS Implementation Challenge was organized to encourage experimental work in the area of network flows and matchings. This volume contains the revised and refereed versions of twenty-two of  Read more... (not yet rated) 0 with reviews - Be the first.

## Find a copy in the library

Finding libraries that hold this item...

## Details

Material Type: Internet resource Book, Internet Resource David S Johnson; Catherine C McGeoch; DIMACS (Group) Find more information about: David S Johnson Catherine C McGeoch 0821865986 9780821865989 28587304 "NSF Science and Technology Center in Discrete Mathematics and Theoretical Computer Science, a consortium of Rutgers University, Princeton University, AT & T Bell Labs, Bellcore."Based on papers presented at the Challenge Workshop, held at DIMACS, Oct. 14-16, 1991. xiv, 592 p. : ill. ; 27 cm. Goldberg's algorithm for maximum flow in perspective: A computational study by R. J. Anderson and J. C. Setubal Implementations of the Goldberg-Tarjan maximum flow algorithm by Q. C. Nguyen and V. Venkateswaran Implementing a maximum flow algorithm: Experiments with dynamic trees by T. Badics and E. Boros Implementing the push-relabel method for the maximum flow problem on a connection machine by F. Alizadeh and A. V. Goldberg A case study in algorithm animation: Maximum flow algorithms by G. E. Shannon, J. MacCuish, and E. Johnson An empirical study of min cost flow algorithms by R. G. Bland, J. Cheriyan, D. L. Jensen, and L. Ladanyi On implementing scaling push-relabel algorithms for the minimum-cost flow problem by A. V. Goldberg and M. Kharitanov Performance evaluation of the MINET minimum cost netflow solver by I. Maros A speculative contraction method for minimum cost flows: Toward a practical algorithm by S. Fujishige, K. Iwano, J. Nakano, and S. Tezuka An experimental implementation of the dual cancel and tighten algorithm for minimum-cost network flow by S. T. McCormick and L. Liu A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope by A. Joshi, A. S. Goldstein, and P. M. Vaidya An efficient implementation of a network interior point method by M. G. C. Resende and G. Veiga On the massively parallel solution of linear network flow problems by S. Neilsen and S. Zenios Approximating concurrent flow with unit demands and capacities: An implementation by J. M. Borger, T. S. Kang, and P. N. Klein Implementation of a combinatorial multicommodity flow algorithm by T. Leong, P. W. Shor, and C. Stein Reverse auction algorithms for assignment problems by D. A. Castanon An approximate dual projective algorithm for solving assignment problems by K. G. Ramakrishnan, N. K. Karmarkar, and A. P. Kamath An implementation of a shortest augmenting path algorithm for the assignment problem by J. Hao and G. Kocur The assignment problem on parallel architectures by M. Brady, K. K. Jung, H. T. Nguyen, R. Raghavan, and R. Subramonian An experimental comparison of two maximum cardinality matching programs by S. T. Crocker Implementing an $O(\sqrt {N}M)$ cardinality matching algorithm by R. B. Mattingly and N. P. Richey Solving large-scale matching problems by D. Applegate and W. Cook Appendix A: Electronically available materials by C. C. McGeoch Appendix B: Panel discussion highlights by D. S. Johnson. DIMACS series in discrete mathematics and theoretical computer science, v. 12. David S. Johnson, Catherine C. McGeoch, editors.

## Reviews

User-contributed reviews

Be the first.

## Similar Items

### Related Subjects:(10)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.