skip to content
Network flows and matching : first DIMACS implementation challenge Preview this item
ClosePreview this item

Network flows and matching : first DIMACS implementation challenge

Author: David S Johnson; Catherine C McGeoch; DIMACS (Group)
Publisher: Providence, R.I. : American Mathematical Society, ©1993.
Series: DIMACS series in discrete mathematics and theoretical computer science, v. 12.
Edition/Format:   Print book : EnglishView all editions and formats

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.

More like this


Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...


Genre/Form: Aufsatzsammlung
Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: David S Johnson; Catherine C McGeoch; DIMACS (Group)
ISBN: 0821865986 9780821865989
OCLC Number: 28587304
Notes: "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.
Description: xiv, 592 pages : illustrations ; 27 cm.
Contents: 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.
Series Title: DIMACS series in discrete mathematics and theoretical computer science, v. 12.
Responsibility: David S. Johnson, Catherine C. McGeoch, editors.
More information:


User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...


Be the first.
Confirm this request

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

Linked Data

Primary Entity

<> # Network flows and matching : first DIMACS implementation challenge
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "28587304" ;
   library:placeOfPublication <> ;
   library:placeOfPublication <> ; # Providence, R.I.
   schema:about <> ; # Computer science--Mathematics
   schema:about <> ; # Computer science--Mathematics
   schema:about <> ; # Computer science--Mathematics
   schema:about <> ; # Computer--Mathematics
   schema:about <> ; # Netzwerkfluss
   schema:about <> ; # Systèmes, Théorie des
   schema:about <> ; # System theory
   schema:about <> ;
   schema:about <> ; # Matching
   schema:about <> ; # System theory
   schema:about <> ; # Systems theory
   schema:about <> ; # Aufsatzsammlung
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <> ; # Catherine C. McGeoch
   schema:contributor <> ; # David S. Johnson
   schema:contributor <> ; # DIMACS (Group)
   schema:contributor <> ; # Challenge Workshop (1991 : DIMACS)
   schema:copyrightYear "1993" ;
   schema:datePublished "1993" ;
   schema:exampleOfWork <> ;
   schema:genre "Aufsatzsammlung"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <> ; # DIMACS series in discrete mathematics and theoretical computer science ;
   schema:name "Network flows and matching : first DIMACS implementation challenge"@en ;
   schema:productID "28587304" ;
   schema:publication <> ;
   schema:publisher <> ; # American Mathematical Society
   schema:url <> ;
   schema:url <> ;
   schema:workExample <> ;
   wdrs:describedby <> ;

Related Entities

<> # American Mathematical Society
    a bgn:Agent ;
   schema:name "American Mathematical Society" ;

<> # David S. Johnson
    a schema:Person ;
   schema:birthDate "1945" ;
   schema:familyName "Johnson" ;
   schema:givenName "David S." ;
   schema:name "David S. Johnson" ;

<> # Catherine C. McGeoch
    a schema:Person ;
   schema:birthDate "1959" ;
   schema:familyName "McGeoch" ;
   schema:givenName "Catherine C." ;
   schema:name "Catherine C. McGeoch" ;

<> # Providence, R.I.
    a schema:Place ;
   schema:name "Providence, R.I." ;

<> # DIMACS series in discrete mathematics and theoretical computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <> ; # Network flows and matching : first DIMACS implementation challenge
   schema:name "DIMACS series in discrete mathematics and theoretical computer science ;" ;

<> # Computer--Mathematics
    a schema:Intangible ;
   schema:name "Computer--Mathematics"@en ;

<> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;

<> # Systèmes, Théorie des
    a schema:Intangible ;
   schema:name "Systèmes, Théorie des"@en ;

<> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;

<> # System theory
    a schema:Intangible ;
   schema:name "System theory"@en ;

<> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;

    a schema:ProductModel ;
   schema:isbn "0821865986" ;
   schema:isbn "9780821865989" ;

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.