Scaling algorithms for the shortest path problem:
Abstract: "We give an O([square root of n]m log N) algorithm for the single-source shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previou...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1429 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We give an O([square root of n]m log N) algorithm for the single-source shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem." |
| Beschreibung: | 11 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008872 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26814595 | ||
| 035 | |a (DE-599)BVBBV009008872 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Goldberg, Andrew |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scaling algorithms for the shortest path problem |c by Andrew Goldberg |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 11 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1429 | |
| 520 | 3 | |a Abstract: "We give an O([square root of n]m log N) algorithm for the single-source shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem." | |
| 650 | 4 | |a Combinatorial optimization | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1429 |w (DE-604)BV008928280 |9 1429 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005955338 | ||
Datensatz im Suchindex
| _version_ | 1804123356050489344 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew |
| author_facet | Goldberg, Andrew |
| author_role | aut |
| author_sort | Goldberg, Andrew |
| author_variant | a g ag |
| building | Verbundindex |
| bvnumber | BV009008872 |
| ctrlnum | (OCoLC)26814595 (DE-599)BVBBV009008872 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01245nam a2200289 cb4500</leader><controlfield tag="001">BV009008872</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26814595</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008872</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scaling algorithms for the shortest path problem</subfield><subfield code="c">by Andrew Goldberg</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">11 S.</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">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1429</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We give an O([square root of n]m log N) algorithm for the single-source shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1429</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1429</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955338</subfield></datafield></record></collection> |
| id | DE-604.BV009008872 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:28Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955338 |
| oclc_num | 26814595 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 11 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Goldberg, Andrew Verfasser aut Scaling algorithms for the shortest path problem by Andrew Goldberg Stanford, Calif. 1992 11 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1429 Abstract: "We give an O([square root of n]m log N) algorithm for the single-source shortest paths problem with integral arc lengths. (Here n and m is the number of nodes and arcs in the input network and N is essentially the absolute value of the most negative arc length.) This improves previous bounds for the problem." Combinatorial optimization Computer Science Department: Report STAN CS Stanford University 1429 (DE-604)BV008928280 1429 |
| spellingShingle | Goldberg, Andrew Scaling algorithms for the shortest path problem Combinatorial optimization |
| title | Scaling algorithms for the shortest path problem |
| title_auth | Scaling algorithms for the shortest path problem |
| title_exact_search | Scaling algorithms for the shortest path problem |
| title_full | Scaling algorithms for the shortest path problem by Andrew Goldberg |
| title_fullStr | Scaling algorithms for the shortest path problem by Andrew Goldberg |
| title_full_unstemmed | Scaling algorithms for the shortest path problem by Andrew Goldberg |
| title_short | Scaling algorithms for the shortest path problem |
| title_sort | scaling algorithms for the shortest path problem |
| topic | Combinatorial optimization |
| topic_facet | Combinatorial optimization |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrew scalingalgorithmsfortheshortestpathproblem |