Euclidean Shortest Paths: Exact or Approximate Algorithms
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
London [u.a.]
Springer
2011
|
| Schlagworte: | |
| Online-Zugang: | BTU01 FHA01 FHM01 FHN01 FKE01 UBA01 UBG01 UBM01 UBR01 UBT01 UBW01 UBY01 UPA01 Volltext |
| Beschreibung: | Lizenzpflichtig |
| Beschreibung: | XVII, 376 S. Ill., graph. Darst. |
| ISBN: | 9781447122555 9781447122562 |
| DOI: | 10.1007/978-1-4471-2256-2 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV039766831 | ||
| 003 | DE-604 | ||
| 005 | 20120601 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 111219s2011 gw |||| o||u| ||||||eng d | ||
| 015 | |a 11,O12 |2 dnb | ||
| 020 | |a 9781447122555 |9 978-1-4471-2255-5 | ||
| 020 | |a 9781447122562 |c Online |9 978-1-4471-2256-2 | ||
| 024 | 7 | |a 10.1007/978-1-4471-2256-2 |2 doi | |
| 024 | 3 | |a 9781447122562 | |
| 035 | |a (OCoLC)772630571 | ||
| 035 | |a (DE-599)BVBBV039766831 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-BE | ||
| 049 | |a DE-473 |a DE-M347 |a DE-20 |a DE-703 |a DE-19 |a DE-Aug4 |a DE-92 |a DE-384 |a DE-355 |a DE-859 |a DE-739 |a DE-706 |a DE-634 | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Li, Fajie |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Euclidean Shortest Paths |b Exact or Approximate Algorithms |c Fajie Li ; Reinhard Klette |
| 264 | 1 | |a London [u.a.] |b Springer |c 2011 | |
| 300 | |a XVII, 376 S. |b Ill., graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Lizenzpflichtig | ||
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 700 | 1 | |a Klette, Reinhard |d 1950-2020 |e Verfasser |0 (DE-588)109615921 |4 aut | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4471-2256-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-024627900 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l BTU01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l FHA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l FHM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l FHN01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l FKE01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBG01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBM01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBR01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBT01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBW01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UBY01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-1-4471-2256-2 |l UPA01 |p ZDB-2-SCS |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804148681152135168 |
|---|---|
| any_adam_object | |
| author | Li, Fajie Klette, Reinhard 1950-2020 |
| author_GND | (DE-588)109615921 |
| author_facet | Li, Fajie Klette, Reinhard 1950-2020 |
| author_role | aut aut |
| author_sort | Li, Fajie |
| author_variant | f l fl r k rk |
| building | Verbundindex |
| bvnumber | BV039766831 |
| classification_rvk | SK 890 |
| collection | ZDB-2-SCS |
| ctrlnum | (OCoLC)772630571 (DE-599)BVBBV039766831 |
| discipline | Informatik Mathematik |
| doi_str_mv | 10.1007/978-1-4471-2256-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02685nmm a2200565zc 4500</leader><controlfield tag="001">BV039766831</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120601 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">111219s2011 gw |||| o||u| ||||||eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">11,O12</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447122555</subfield><subfield code="9">978-1-4471-2255-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447122562</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4471-2256-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4471-2256-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9781447122562</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)772630571</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039766831</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-473</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Li, Fajie</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Euclidean Shortest Paths</subfield><subfield code="b">Exact or Approximate Algorithms</subfield><subfield code="c">Fajie Li ; Reinhard Klette</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">London [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2011</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVII, 376 S.</subfield><subfield code="b">Ill., 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">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="500" ind1=" " ind2=" "><subfield code="a">Lizenzpflichtig</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Kürzester-Weg-Problem</subfield><subfield code="0">(DE-588)4138403-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">Klette, Reinhard</subfield><subfield code="d">1950-2020</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)109615921</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024627900</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">FHA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">FHM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">FKE01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBG01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBR01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4471-2256-2</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV039766831 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T00:11:00Z |
| institution | BVB |
| isbn | 9781447122555 9781447122562 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024627900 |
| oclc_num | 772630571 |
| open_access_boolean | |
| owner | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-19 DE-BY-UBM DE-Aug4 DE-92 DE-384 DE-355 DE-BY-UBR DE-859 DE-739 DE-706 DE-634 |
| owner_facet | DE-473 DE-BY-UBG DE-M347 DE-20 DE-703 DE-19 DE-BY-UBM DE-Aug4 DE-92 DE-384 DE-355 DE-BY-UBR DE-859 DE-739 DE-706 DE-634 |
| physical | XVII, 376 S. Ill., graph. Darst. |
| psigel | ZDB-2-SCS |
| publishDate | 2011 |
| publishDateSearch | 2011 |
| publishDateSort | 2011 |
| publisher | Springer |
| record_format | marc |
| spelling | Li, Fajie Verfasser aut Euclidean Shortest Paths Exact or Approximate Algorithms Fajie Li ; Reinhard Klette London [u.a.] Springer 2011 XVII, 376 S. Ill., graph. Darst. txt rdacontent c rdamedia cr rdacarrier Lizenzpflichtig Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Kürzester-Weg-Problem (DE-588)4138403-9 s DE-604 Klette, Reinhard 1950-2020 Verfasser (DE-588)109615921 aut https://doi.org/10.1007/978-1-4471-2256-2 Verlag Volltext |
| spellingShingle | Li, Fajie Klette, Reinhard 1950-2020 Euclidean Shortest Paths Exact or Approximate Algorithms Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| subject_GND | (DE-588)4138403-9 |
| title | Euclidean Shortest Paths Exact or Approximate Algorithms |
| title_auth | Euclidean Shortest Paths Exact or Approximate Algorithms |
| title_exact_search | Euclidean Shortest Paths Exact or Approximate Algorithms |
| title_full | Euclidean Shortest Paths Exact or Approximate Algorithms Fajie Li ; Reinhard Klette |
| title_fullStr | Euclidean Shortest Paths Exact or Approximate Algorithms Fajie Li ; Reinhard Klette |
| title_full_unstemmed | Euclidean Shortest Paths Exact or Approximate Algorithms Fajie Li ; Reinhard Klette |
| title_short | Euclidean Shortest Paths |
| title_sort | euclidean shortest paths exact or approximate algorithms |
| title_sub | Exact or Approximate Algorithms |
| topic | Kürzester-Weg-Problem (DE-588)4138403-9 gnd |
| topic_facet | Kürzester-Weg-Problem |
| url | https://doi.org/10.1007/978-1-4471-2256-2 |
| work_keys_str_mv | AT lifajie euclideanshortestpathsexactorapproximatealgorithms AT klettereinhard euclideanshortestpathsexactorapproximatealgorithms |