Euclidean shortest paths: exact or approximate algorithms
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
London
Springer
2011
|
Schlagworte: | |
Beschreibung: | XVII, 376 S. Ill., graph. Darst., Kt. |
ISBN: | 9781447122555 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV039910567 | ||
003 | DE-604 | ||
005 | 20120918 | ||
007 | t | ||
008 | 120223s2011 xxkabd| |||| 00||| eng d | ||
020 | |a 9781447122555 |9 978-1-4471-2255-5 | ||
035 | |a (OCoLC)890848768 | ||
035 | |a (DE-599)BVBBV039910567 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
044 | |a xxk |c GB | ||
049 | |a DE-11 |a DE-83 | ||
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 |b Springer |c 2011 | |
300 | |a XVII, 376 S. |b Ill., graph. Darst., Kt. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
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 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-024769239 |
Datensatz im Suchindex
_version_ | 1804148866813001728 |
---|---|
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 | BV039910567 |
classification_rvk | SK 890 |
ctrlnum | (OCoLC)890848768 (DE-599)BVBBV039910567 |
discipline | Mathematik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01057nam a2200325 c 4500</leader><controlfield tag="001">BV039910567</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20120918 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120223s2011 xxkabd| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781447122555</subfield><subfield code="9">978-1-4471-2255-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)890848768</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV039910567</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-11</subfield><subfield code="a">DE-83</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</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., Kt.</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="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="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-024769239</subfield></datafield></record></collection> |
id | DE-604.BV039910567 |
illustrated | Illustrated |
indexdate | 2024-07-10T00:13:57Z |
institution | BVB |
isbn | 9781447122555 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-024769239 |
oclc_num | 890848768 |
open_access_boolean | |
owner | DE-11 DE-83 |
owner_facet | DE-11 DE-83 |
physical | XVII, 376 S. Ill., graph. Darst., Kt. |
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 Springer 2011 XVII, 376 S. Ill., graph. Darst., Kt. txt rdacontent n rdamedia nc rdacarrier 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 |
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 |
work_keys_str_mv | AT lifajie euclideanshortestpathsexactorapproximatealgorithms AT klettereinhard euclideanshortestpathsexactorapproximatealgorithms |