Shortest paths alogrithms: theory and experimental evaluation
Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1993
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1480 |
| Subjects: | |
| Summary: | Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research." |
| Physical Description: | 46 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041468 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)30464429 | ||
| 035 | |a (DE-599)BVBBV009041468 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Cherkassky, Boris V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Shortest paths alogrithms |b theory and experimental evaluation |c Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 46 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 1480 | |
| 520 | 3 | |a Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Network analysis (Planning) | |
| 700 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 700 | 1 | |a Radzik, Tomasz |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1480 |w (DE-604)BV008928280 |9 1480 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982792 | ||
Record in the Search Index
| _version_ | 1804123396258136064 |
|---|---|
| any_adam_object | |
| author | Cherkassky, Boris V. Goldberg, Andrew V. Radzik, Tomasz |
| author_facet | Cherkassky, Boris V. Goldberg, Andrew V. Radzik, Tomasz |
| author_role | aut aut aut |
| author_sort | Cherkassky, Boris V. |
| author_variant | b v c bv bvc a v g av avg t r tr |
| building | Verbundindex |
| bvnumber | BV009041468 |
| ctrlnum | (OCoLC)30464429 (DE-599)BVBBV009041468 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01808nam a2200325 cb4500</leader><controlfield tag="001">BV009041468</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30464429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041468</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></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Cherkassky, Boris V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Shortest paths alogrithms</subfield><subfield code="b">theory and experimental evaluation</subfield><subfield code="c">Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">46 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">1480</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Radzik, Tomasz</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">1480</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1480</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982792</subfield></datafield></record></collection> |
| id | DE-604.BV009041468 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982792 |
| oclc_num | 30464429 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 46 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Cherkassky, Boris V. Verfasser aut Shortest paths alogrithms theory and experimental evaluation Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik Stanford, Calif. 1993 46 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1480 Abstract: "We conduct an extensive computational study of shortest paths algorithms, including some very recent algorithms. We also suggest new algorithms motivated by the experimental results and prove interesting theoretical results suggested by the experimental data. Our computational study is based on several natural problem classes which identify strengths and weaknesses of various algorithms. These problem classes and algorithm implementations form an environment for testing the performance of shortest paths algorithms. The interaction between the experimental evaluation of algorithm behavior and the theoretical analysis of algorithm performance plays an important role in our research." Computer algorithms Network analysis (Planning) Goldberg, Andrew V. Verfasser aut Radzik, Tomasz Verfasser aut Computer Science Department: Report STAN CS Stanford University 1480 (DE-604)BV008928280 1480 |
| spellingShingle | Cherkassky, Boris V. Goldberg, Andrew V. Radzik, Tomasz Shortest paths alogrithms theory and experimental evaluation Computer algorithms Network analysis (Planning) |
| title | Shortest paths alogrithms theory and experimental evaluation |
| title_auth | Shortest paths alogrithms theory and experimental evaluation |
| title_exact_search | Shortest paths alogrithms theory and experimental evaluation |
| title_full | Shortest paths alogrithms theory and experimental evaluation Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik |
| title_fullStr | Shortest paths alogrithms theory and experimental evaluation Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik |
| title_full_unstemmed | Shortest paths alogrithms theory and experimental evaluation Boris V. Cherkassky ; Andrew V. Goldberg ; Tomasz Radzik |
| title_short | Shortest paths alogrithms |
| title_sort | shortest paths alogrithms theory and experimental evaluation |
| title_sub | theory and experimental evaluation |
| topic | Computer algorithms Network analysis (Planning) |
| topic_facet | Computer algorithms Network analysis (Planning) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT cherkasskyborisv shortestpathsalogrithmstheoryandexperimentalevaluation AT goldbergandrewv shortestpathsalogrithmstheoryandexperimentalevaluation AT radziktomasz shortestpathsalogrithmstheoryandexperimentalevaluation |