Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991 - researchr publication

researchr

You are not signed in
Sign in
Sign up

David S. Johnson, Catherine C. McGeoch, editors, Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991. Volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, DIMACS/AMS, 1993. [doi]

Conference: dimacs1993

Abstract is missing.

PrefaceDavid S. Johnson, Catherine C. McGeoch.

Goldberg's Algorithm for Maximum Flow in Perspective: A Computational StudyRichard J. Anderson, João Carlos Setubal. 1-18

Implementations of the Goldberg-Tarjan Maximum Flow AlgorithmQ. C. Nguyen, Venkat Venkateswaran. 19-42

Implementing a Maximum Flow Algorithm: Experiments with Dynamic TreesTamás Badics, Endre Boros. 43-64

Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection MachineFarid Alizadeth, Andrew V. Goldberg. 65-96

A Case Study in Algorithm Animation: Maximum Flow AlgorithmsGregory E. Shannon, John MacCuish, Elisabeth Johnson. 97-118

An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow ProblemRobert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi. 119-156

On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow ProblemAndrew V. Goldberg, Michael Kharitonov. 157-198

Performance Evaluation of the MINET Minimum Cost Netflow SolverIstván Maros. 199-218

A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical AlgorithmSatoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka. 219-246

An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network FlowS. Thomas McCormick, Li Liu. 247-266

A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network PolytopeAnil Joshi, Arthur S. Goldstein, Pravin M. Vaidya. 267-298

An Efficient Implementation of a Network Interior Point MethodMauricio G. C. Resende, Geraldo Veiga. 299-348

On the Massively Parallel Solution of Linear Network Flow ProblemsSøren S. Nielsen, Stavros A. Zenios. 349-370

Approximating Concurrent Flow with Unit Demands and Capacities: An ImplementationJames M. Borger, Sarah Kang, Philip N. Klein. 371-386

Implementation of a Combinatorial Multicommodity Flow AlgorithmTishya Leong, Peter W. Shor, Clifford Stein. 387-406

Reverse Auction Algorithms for Assignment ProblemsDavid A. Castañón. 407-430

An Approximate Dual Projective Algorithm for Solving Assignment ProblemsK. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath. 431-452

An Implementation of a Shortest Augmenting Path Algorithm for the Assignment ProblemJack Jianxiu Hao, George Kocur. 453-468

The Assignment Problem on Parallel ArchitecturesMartin Lee Brady, Kenneth K. Jung, H. T. Nguyen, Raghu Raghavan, Ramesh Subramonian. 469-518

An Experimental Comparison of Two Maximum Cardinality Matching ProgramsSteven T. Crocker. 519-538

Implementing on O(/NM) Cardinality Matching AlgorithmR. Bruce Mattingly, Nathan P. Ritchey. 539-556

Solving Large-Scale Matching ProblemsDavid Applegate, William J. Cook. 557-576

Appendix A: Electronically Available MaterialsCatherine C. McGeoch. 577-582

Appendix B: Panel Discussion HighlightsDavid S. Johnson. 583

runs on WebDSL