Network flows and matching: first DIMACS implementation challenge
Gespeichert in:
| Format: | Buch |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Providence, R.I.
American Mathemat. Society
1993
|
| Schriftenreihe: | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science
12 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XIV, 592 S. graph. Darst. |
| ISBN: | 0821865986 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010148637 | ||
| 003 | DE-604 | ||
| 005 | 20120731 | ||
| 007 | t | ||
| 008 | 950420s1993 d||| |||| 10||| eng d | ||
| 020 | |a 0821865986 |9 0-8218-6598-6 | ||
| 035 | |a (OCoLC)28587304 | ||
| 035 | |a (DE-599)BVBBV010148637 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-83 | ||
| 050 | 0 | |a QA76.9.M35 | |
| 082 | 0 | |a 511/.8 |2 20 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
| 084 | |a 68Qxx |2 msc | ||
| 245 | 1 | 0 | |a Network flows and matching |b first DIMACS implementation challenge |c David S. Johnson ..., eds. |
| 264 | 1 | |a Providence, R.I. |b American Mathemat. Society |c 1993 | |
| 300 | |a XIV, 592 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 12 | |
| 650 | 7 | |a Systèmes, Théorie des |2 ram | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 650 | 4 | |a Computer science |x Mathematics | |
| 650 | 4 | |a System theory | |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Matching |0 (DE-588)4212483-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
| 655 | 7 | |0 (DE-588)1071861417 |a Konferenzschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | 1 | |a Matching |0 (DE-588)4212483-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Johnson, David S. |e Sonstige |4 oth | |
| 830 | 0 | |a Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |v 12 |w (DE-604)BV004648770 |9 12 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006740641&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006740641 | ||
Datensatz im Suchindex
| _version_ | 1804124543549177856 |
|---|---|
| adam_text | Contents
Foreword be
Preface
D. S. Johnson and C. C. McGeoch xi
Goldberg s Algorithm for Maximum Flow in Perspective:
A Computational Study
R. J. Anderson and J. C. Setubal 1
Implementations of the Goldberg Tarjan Maximum Flow
Algorithm
Q. C. Nguyen and V. Venkateswaran 19
Implementing a Maximum Flow Algorithm: Experiments with
Dynamic Trees
T. Badics and E. Boros 43
Implementing the Push Relabel Method for the Maximum Flow
Problem on a Connection Machine
F. Alizadeh and A. V. Goldberg 65
A Case Study in Algorithm Animation: Maximum Flow Algorithms
G. E. Shannon, J. MacCuish, and E. Johnson 97
An Empirical Study of Min Cost Flow Algorithms
R. G. Bland, J. Cheriyan, D. L. Jensen, and 119
L. Ladanyi
On Implementing Scaling Push Relabel Algorithms for the
Minimum Cost Flow Problem
A. V. Goldberg and M. Kharitanov 157
Performance Evaluation of the MINET Minimum Cost Netflow
Solver
I. Maros 199
V
vi CONTENTS
A Speculative Contraction Method for Minimum Cost Flows:
Toward a Practical Algorithm
S. FUJISHIGE, K. IWANO, J. NAKANO, AND S. TEZUKA 219
An Experimental Implementation of the Dual Cancel and Tighten
Algorithm for Minimum Cost Network Flow
S. T. McCormick AND L. Liu 247
A Fast Implementation of a Path Following Algorithm for
Maximizing a Linear Function over a Network Polytope
A. Joshi, A. S. Goldstein, and P. M. Vaidya 267
An Efficient Implementation of a Network Interior Point Method
M. G. C. Resende and G. Veiga 299
On the Massively Parallel Solution of Linear Network Flow Problems
S. Neilsen and S. Zenios 349
Approximating Concurrent Flow with Unit Demands and Capacities:
An Implementation
J. M. Borger, T. S. Kang, and P. N. Klein 371
Implementation of a Combinatorial Multicommodity Flow Algorithm
T. Leong, P. W. Shor, and C. Stein 387
Reverse Auction Algorithms for Assignment Problems
D. A. Castanon 407
An Approximate Dual Projective Algorithm for Solving Assignment
Problems
K. G. Ramakrishnan, N. K. Karmarkar, and
A. P. Kamath 431
An Implementation of a Shortest Augmenting Path Algorithm for
the Assignment Problem
J. Hao and G. Kocur 453
CONTENTS vii
The Assignment Problem on Parallel Architectures
M. Brady, K. K. Jung, H. T. Nguyen, R. Raghavan, and
R. SUBRAMONIAN 469
An Experimental Comparison of Two Maximum Cardinality
Matching Programs
S. T. Crocker 519
Implementing an 0{y/~NM) Cardinality Matching Algorithm
R. B. Mattingly and N. P. Ritchey 539
Solving Large Scale Matching Problems
D. Applegate and W. Cook 557
Appendix A: Electronically Available Materials
C. C. McGeoch 577
Appendix B: Panel Discussion Highlights
D. S. Johnson 583
|
| any_adam_object | 1 |
| building | Verbundindex |
| bvnumber | BV010148637 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.M35 |
| callnumber-search | QA76.9.M35 |
| callnumber-sort | QA 276.9 M35 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 ST 132 |
| ctrlnum | (OCoLC)28587304 (DE-599)BVBBV010148637 |
| dewey-full | 511/.8 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.8 |
| dewey-search | 511/.8 |
| dewey-sort | 3511 18 |
| dewey-tens | 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02122nam a2200493 cb4500</leader><controlfield tag="001">BV010148637</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120731 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950420s1993 d||| |||| 10||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0821865986</subfield><subfield code="9">0-8218-6598-6</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28587304</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010148637</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.M35</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.8</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Qxx</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network flows and matching</subfield><subfield code="b">first DIMACS implementation challenge</subfield><subfield code="c">David S. Johnson ..., eds.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Providence, R.I.</subfield><subfield code="b">American Mathemat. Society</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIV, 592 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">12</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Systèmes, Théorie des</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield><subfield code="x">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">System theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Matching</subfield><subfield code="0">(DE-588)4212483-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Matching</subfield><subfield code="0">(DE-588)4212483-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David S.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science</subfield><subfield code="v">12</subfield><subfield code="w">(DE-604)BV004648770</subfield><subfield code="9">12</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006740641&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006740641</subfield></datafield></record></collection> |
| genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content (DE-588)1071861417 Konferenzschrift gnd-content |
| genre_facet | Aufsatzsammlung Konferenzschrift |
| id | DE-604.BV010148637 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:47:20Z |
| institution | BVB |
| isbn | 0821865986 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006740641 |
| oclc_num | 28587304 |
| open_access_boolean | |
| owner | DE-384 DE-83 |
| owner_facet | DE-384 DE-83 |
| physical | XIV, 592 S. graph. Darst. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | American Mathemat. Society |
| record_format | marc |
| series | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| series2 | Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science |
| spelling | Network flows and matching first DIMACS implementation challenge David S. Johnson ..., eds. Providence, R.I. American Mathemat. Society 1993 XIV, 592 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 12 Systèmes, Théorie des ram Informatik Mathematik Computer science Mathematics System theory Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Matching (DE-588)4212483-9 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content (DE-588)1071861417 Konferenzschrift gnd-content Netzwerkfluss (DE-588)4126130-6 s Matching (DE-588)4212483-9 s DE-604 Johnson, David S. Sonstige oth Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science 12 (DE-604)BV004648770 12 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006740641&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Network flows and matching first DIMACS implementation challenge Center for Discrete Mathematics and Theoretical Computer Science <New Brunswick, NJ>: DIMACS series in discrete mathematics and theoretical computer science Systèmes, Théorie des ram Informatik Mathematik Computer science Mathematics System theory Netzwerkfluss (DE-588)4126130-6 gnd Matching (DE-588)4212483-9 gnd |
| subject_GND | (DE-588)4126130-6 (DE-588)4212483-9 (DE-588)4143413-4 (DE-588)1071861417 |
| title | Network flows and matching first DIMACS implementation challenge |
| title_auth | Network flows and matching first DIMACS implementation challenge |
| title_exact_search | Network flows and matching first DIMACS implementation challenge |
| title_full | Network flows and matching first DIMACS implementation challenge David S. Johnson ..., eds. |
| title_fullStr | Network flows and matching first DIMACS implementation challenge David S. Johnson ..., eds. |
| title_full_unstemmed | Network flows and matching first DIMACS implementation challenge David S. Johnson ..., eds. |
| title_short | Network flows and matching |
| title_sort | network flows and matching first dimacs implementation challenge |
| title_sub | first DIMACS implementation challenge |
| topic | Systèmes, Théorie des ram Informatik Mathematik Computer science Mathematics System theory Netzwerkfluss (DE-588)4126130-6 gnd Matching (DE-588)4212483-9 gnd |
| topic_facet | Systèmes, Théorie des Informatik Mathematik Computer science Mathematics System theory Netzwerkfluss Matching Aufsatzsammlung Konferenzschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006740641&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV004648770 |
| work_keys_str_mv | AT johnsondavids networkflowsandmatchingfirstdimacsimplementationchallenge |