The shortest-path problem: analysis and comparison of methods
Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road netwo...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
© 2015
|
| Schriftenreihe: | Synthesis lectures on theoretical computer science
#1 |
| Schlagworte: | |
| Online-Zugang: | UER01 Volltext |
| Zusammenfassung: | Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology |
| Beschreibung: | Online Ressource (xv, 71 pages) illustrations |
| ISBN: | 9781627055406 |
| DOI: | 10.2200/S00618ED1V01Y201412TCS001 |
Internformat
MARC
| LEADER | 00000nmm a22000001cb4500 | ||
|---|---|---|---|
| 001 | BV044754768 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 180209s2015 |||| o||u| ||||||eng d | ||
| 020 | |a 9781627055406 |c ebook |9 978-1-62705-540-6 | ||
| 024 | 7 | |a 10.2200/S00618ED1V01Y201412TCS001 |2 doi | |
| 035 | |a (OCoLC)1024115634 | ||
| 035 | |a (DE-599)BSZ430175124 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29 | ||
| 050 | 0 | |a QA166.245 | |
| 082 | 0 | |a 511.5 | |
| 100 | 1 | |a Ortega-Arranz, Hector |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The shortest-path problem |b analysis and comparison of methods |c Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain) |
| 264 | 0 | |a [San Rafael, California] |b Morgan & Claypool Publishers |c [2015] | |
| 264 | 4 | |c © 2015 | |
| 300 | |a Online Ressource (xv, 71 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Synthesis lectures on theoretical computer science |v #1 | |
| 520 | 3 | |a Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology | |
| 653 | 0 | |a Graph algorithms | |
| 653 | 0 | |a Paths and cycles (Graph theory) | |
| 700 | 1 | |a Llanos, Diego R. |e Verfasser |4 aut | |
| 700 | 1 | |a Gonzalez-Escribano, Arturo |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe, Paperback |z 978-1-62705-539-0 |
| 830 | 0 | |a Synthesis lectures on theoretical computer science |v #1 |w (DE-604)BV044754765 |9 1 | |
| 856 | 4 | 0 | |u https://doi.org/10.2200/S00618ED1V01Y201412TCS001 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-37-IEX |a ZDB-105-MCS |a ZDB-105-MCB | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030150328 | ||
| 966 | e | |u https://doi.org/10.2200/S00618ED1V01Y201412TCS001 |l UER01 |p ZDB-105-MCB |q UER_Einzelkauf |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804178270395039744 |
|---|---|
| any_adam_object | |
| author | Ortega-Arranz, Hector Llanos, Diego R. Gonzalez-Escribano, Arturo |
| author_facet | Ortega-Arranz, Hector Llanos, Diego R. Gonzalez-Escribano, Arturo |
| author_role | aut aut aut |
| author_sort | Ortega-Arranz, Hector |
| author_variant | h o a hoa d r l dr drl a g e age |
| building | Verbundindex |
| bvnumber | BV044754768 |
| callnumber-first | Q - Science |
| callnumber-label | QA166 |
| callnumber-raw | QA166.245 |
| callnumber-search | QA166.245 |
| callnumber-sort | QA 3166.245 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-37-IEX ZDB-105-MCS ZDB-105-MCB |
| ctrlnum | (OCoLC)1024115634 (DE-599)BSZ430175124 |
| dewey-full | 511.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.5 |
| dewey-search | 511.5 |
| dewey-sort | 3511.5 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.2200/S00618ED1V01Y201412TCS001 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02707nmm a22004331cb4500</leader><controlfield tag="001">BV044754768</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">180209s2015 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781627055406</subfield><subfield code="c">ebook</subfield><subfield code="9">978-1-62705-540-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.2200/S00618ED1V01Y201412TCS001</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1024115634</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BSZ430175124</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA166.245</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ortega-Arranz, Hector</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The shortest-path problem</subfield><subfield code="b">analysis and comparison of methods</subfield><subfield code="c">Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain)</subfield></datafield><datafield tag="264" ind1=" " ind2="0"><subfield code="a">[San Rafael, California]</subfield><subfield code="b">Morgan & Claypool Publishers</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2015</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online Ressource (xv, 71 pages)</subfield><subfield code="b">illustrations</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Synthesis lectures on theoretical computer science</subfield><subfield code="v">#1</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Graph algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Paths and cycles (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Llanos, Diego R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gonzalez-Escribano, Arturo</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe, Paperback</subfield><subfield code="z">978-1-62705-539-0</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Synthesis lectures on theoretical computer science</subfield><subfield code="v">#1</subfield><subfield code="w">(DE-604)BV044754765</subfield><subfield code="9">1</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.2200/S00618ED1V01Y201412TCS001</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-37-IEX</subfield><subfield code="a">ZDB-105-MCS</subfield><subfield code="a">ZDB-105-MCB</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030150328</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.2200/S00618ED1V01Y201412TCS001</subfield><subfield code="l">UER01</subfield><subfield code="p">ZDB-105-MCB</subfield><subfield code="q">UER_Einzelkauf</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044754768 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:01:18Z |
| institution | BVB |
| isbn | 9781627055406 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030150328 |
| oclc_num | 1024115634 |
| open_access_boolean | |
| owner | DE-29 |
| owner_facet | DE-29 |
| physical | Online Ressource (xv, 71 pages) illustrations |
| psigel | ZDB-37-IEX ZDB-105-MCS ZDB-105-MCB ZDB-105-MCB UER_Einzelkauf |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| record_format | marc |
| series | Synthesis lectures on theoretical computer science |
| series2 | Synthesis lectures on theoretical computer science |
| spelling | Ortega-Arranz, Hector Verfasser aut The shortest-path problem analysis and comparison of methods Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain) [San Rafael, California] Morgan & Claypool Publishers [2015] © 2015 Online Ressource (xv, 71 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Synthesis lectures on theoretical computer science #1 Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark. The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology Graph algorithms Paths and cycles (Graph theory) Llanos, Diego R. Verfasser aut Gonzalez-Escribano, Arturo Verfasser aut Erscheint auch als Druck-Ausgabe, Paperback 978-1-62705-539-0 Synthesis lectures on theoretical computer science #1 (DE-604)BV044754765 1 https://doi.org/10.2200/S00618ED1V01Y201412TCS001 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Ortega-Arranz, Hector Llanos, Diego R. Gonzalez-Escribano, Arturo The shortest-path problem analysis and comparison of methods Synthesis lectures on theoretical computer science |
| title | The shortest-path problem analysis and comparison of methods |
| title_auth | The shortest-path problem analysis and comparison of methods |
| title_exact_search | The shortest-path problem analysis and comparison of methods |
| title_full | The shortest-path problem analysis and comparison of methods Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain) |
| title_fullStr | The shortest-path problem analysis and comparison of methods Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain) |
| title_full_unstemmed | The shortest-path problem analysis and comparison of methods Hector Ortega-Arranz, Diego R. Llanos, and Arturo Gonzalez-Escribano (Universidad de Valladolid, Spain) |
| title_short | The shortest-path problem |
| title_sort | the shortest path problem analysis and comparison of methods |
| title_sub | analysis and comparison of methods |
| url | https://doi.org/10.2200/S00618ED1V01Y201412TCS001 |
| volume_link | (DE-604)BV044754765 |
| work_keys_str_mv | AT ortegaarranzhector theshortestpathproblemanalysisandcomparisonofmethods AT llanosdiegor theshortestpathproblemanalysisandcomparisonofmethods AT gonzalezescribanoarturo theshortestpathproblemanalysisandcomparisonofmethods |