AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Network Flows and Matching: First DIMACS Implementation Challenge
About this Title
David S. Johnson and Catherine C. McGeoch, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1993; Volume 12
ISBNs: 978-0-8218-6598-9 (print); 978-1-4704-3970-5 (online)
DOI: https://doi.org/10.1090/dimacs/012
ReadershipTable of Contents
Front/Back Matter
Chapters
- Goldberg’s algorithm for maximum flow in perspective: a computational study
- Implementations of the Goldberg-Tarjan maximum flow algorithm
- Implementing a maximum flow algorithm: experiments with dynamic trees
- Implementing the push-relabel method for the maximum flow problem on a connection machine
- A case study in algorithm animation: maximum flow algorithms
- An empirical study of Min cost flow algorithms
- On implementing scaling push-relabel algorithms for the minimum-relabel algorithms for the minimum-cost flow problem
- Performance evaluation of the MINET minimum cost netflow solver
- A speculative contraction method for minimum cost flows: toward a practical algorithm
- An experimental implementation of the dual cancel and tighten algorithm for minimum-cost network flow
- A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope
- An efficient implementation of a network interior point method
- On the massively parallel solution of linear network flow problems
- Approximating concurrent flow with unit demands and capacities: an implementation
- Implementation of a combinatorial multicommodity flow algorithm
- Reverse auction algorithms for assignment problems
- An approximate dual projective algorithm for solving assignment problems
- An implementation of a shortest augmenting path algorithm for the assignment problem
- The assignment problem on parallel architectures
- An experimental comparison of two maximum cardinality matching programs
- Implementing an $O(\sqrt {N}M)$ cardinality matching algorithm
- Solving large-scale matching problems
- appendix A. Electronically available materials
- appendix B. Panel discussion highlights