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

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
Database:WorldCat
Summary:

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...

Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
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...

Details

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. --
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-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 Cardinality Matching Algorithm. --
Solving Large-Scale Matching Problems. --
Appendix A: Electronically Available Materials. --
Appendix B: Panel Discussion Highlights.
Series Title: DIMACS series in discrete mathematics and theoretical computer science, v. 12.
Responsibility: David S. Johnson, Catherine C. McGeoch, editors.
More information:

Reviews

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

Tags

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

<http://www.worldcat.org/oclc/28587304> # Network flows and matching : first DIMACS implementation challenge
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "28587304" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/riu> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/479334413#Place/providence_r_i> ; # Providence, R.I.
   schema:about <http://id.worldcat.org/fast/872460> ; # Computer science--Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/computer_science_mathematics> ; # Computer science--Mathematics
   schema:about <http://id.loc.gov/authorities/subjects/sh85042295> ; # Computer science--Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/computer_mathematics> ; # Computer--Mathematics
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/netzwerkfluss> ; # Netzwerkfluss
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/systemes_theorie_des> ; # Systèmes, Théorie des
   schema:about <http://id.worldcat.org/fast/1141423> ; # System theory
   schema:about <http://dewey.info/class/511.8/e20/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/matching> ; # Matching
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/system_theory> ; # System theory
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/systems_theory> ; # Systems theory
   schema:about <http://experiment.worldcat.org/entity/work/data/479334413#Topic/aufsatzsammlung> ; # Aufsatzsammlung
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/169401409> ; # DIMACS (Group)
   schema:contributor <http://viaf.org/viaf/94766987> ; # David S. Johnson
   schema:contributor <http://viaf.org/viaf/71366376> ; # Catherine C. McGeoch
   schema:contributor <http://experiment.worldcat.org/entity/work/data/479334413#Meeting/challenge_workshop_1991_dimacs> ; # Challenge Workshop (1991 : DIMACS)
   schema:copyrightYear "1993" ;
   schema:datePublished "1993" ;
   schema:description "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-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 Cardinality Matching Algorithm. -- Solving Large-Scale Matching Problems. -- Appendix A: Electronically Available Materials. -- Appendix B: Panel Discussion Highlights."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/479334413> ;
   schema:genre "Aufsatzsammlung"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/479334413#Series/dimacs_series_in_discrete_mathematics_and_theoretical_computer_science> ; # 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 <http://www.worldcat.org/title/-/oclc/28587304#PublicationEvent/providence_r_i_american_mathematical_society_1993> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/479334413#Agent/american_mathematical_society> ; # American Mathematical Society
   schema:url <http://www.gbv.de/dms/hbz/toc/ht006151763.pdf> ;
   schema:url <http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&doc_number=006740641&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA> ;
   schema:workExample <http://worldcat.org/isbn/9780821865989> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/28587304> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/479334413#Agent/american_mathematical_society> # American Mathematical Society
    a bgn:Agent ;
   schema:name "American Mathematical Society" ;
    .

<http://experiment.worldcat.org/entity/work/data/479334413#Place/providence_r_i> # Providence, R.I.
    a schema:Place ;
   schema:name "Providence, R.I." ;
    .

<http://experiment.worldcat.org/entity/work/data/479334413#Series/dimacs_series_in_discrete_mathematics_and_theoretical_computer_science> # DIMACS series in discrete mathematics and theoretical computer science ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/28587304> ; # Network flows and matching : first DIMACS implementation challenge
   schema:name "DIMACS series in discrete mathematics and theoretical computer science ;" ;
    .

<http://experiment.worldcat.org/entity/work/data/479334413#Topic/computer_mathematics> # Computer--Mathematics
    a schema:Intangible ;
   schema:name "Computer--Mathematics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/479334413#Topic/computer_science_mathematics> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/479334413#Topic/systemes_theorie_des> # Systèmes, Théorie des
    a schema:Intangible ;
   schema:name "Systèmes, Théorie des"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh85042295> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;
    .

<http://id.worldcat.org/fast/1141423> # System theory
    a schema:Intangible ;
   schema:name "System theory"@en ;
    .

<http://id.worldcat.org/fast/872460> # Computer science--Mathematics
    a schema:Intangible ;
   schema:name "Computer science--Mathematics"@en ;
    .

<http://viaf.org/viaf/169401409> # DIMACS (Group)
    a schema:Organization ;
   schema:name "DIMACS (Group)" ;
    .

<http://viaf.org/viaf/71366376> # Catherine C. McGeoch
    a schema:Person ;
   schema:birthDate "1959" ;
   schema:familyName "McGeoch" ;
   schema:givenName "Catherine C." ;
   schema:name "Catherine C. McGeoch" ;
    .

<http://viaf.org/viaf/94766987> # David S. Johnson
    a schema:Person ;
   schema:birthDate "1945" ;
   schema:familyName "Johnson" ;
   schema:givenName "David S." ;
   schema:name "David S. Johnson" ;
    .

<http://worldcat.org/isbn/9780821865989>
    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.