Unobstructed shortest paths in polyhedral environments:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
1987
|
| Schriftenreihe: | Lecture notes in computer science
251 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 1 Online-Ressource (103 S.) |
| ISBN: | 3540176292 0387176292 |
| DOI: | 10.1007/3-540-17629-2 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV035880739 | ||
| 003 | DE-604 | ||
| 005 | 20211008 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 091211s1987 xx o|||| 00||| eng d | ||
| 020 | |a 3540176292 |9 3-540-17629-2 | ||
| 020 | |a 0387176292 |9 0-387-17629-2 | ||
| 024 | 7 | |a 10.1007/3-540-17629-2 |2 doi | |
| 035 | |a (OCoLC)699823256 | ||
| 035 | |a (DE-599)BVBBV035880739 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-634 |a DE-210 |a DE-Aug4 |a DE-M347 |a DE-860 |a DE-70 |a DE-91 |a DE-384 |a DE-473 |a DE-19 |a DE-355 |a DE-703 |a DE-29 |a DE-739 |a DE-859 |a DE-1046 |a DE-706 |a DE-526 |a DE-521 |a DE-573 |a DE-523 | ||
| 084 | |a DAT 537d |2 stub | ||
| 100 | 1 | |a Akman, Varol |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Unobstructed shortest paths in polyhedral environments |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 1987 | |
| 300 | |a 1 Online-Ressource (103 S.) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Lecture notes in computer science |v 251 | |
| 650 | 0 | 7 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polyeder |0 (DE-588)4132101-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Polyedergebiet |0 (DE-588)4175160-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Polyedergebiet |0 (DE-588)4175160-7 |D s |
| 689 | 0 | 1 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Polyeder |0 (DE-588)4132101-7 |D s |
| 689 | 1 | 1 | |a Kürzester-Weg-Problem |0 (DE-588)4138403-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Lecture notes in computer science |v 251 |w (DE-604)BV014880109 |9 251 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/3-540-17629-2 |x Verlag |3 Volltext |
| 912 | |a ZDB-1-SLN | ||
| 912 | |a ZDB-2-LNC | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-018738326 | |
Datensatz im Suchindex
| _version_ | 1820875195244609536 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Akman, Varol |
| author_facet | Akman, Varol |
| author_role | aut |
| author_sort | Akman, Varol |
| author_variant | v a va |
| building | Verbundindex |
| bvnumber | BV035880739 |
| classification_rvk | SS 4800 |
| classification_tum | DAT 537d |
| collection | ZDB-1-SLN ZDB-2-LNC |
| ctrlnum | (OCoLC)699823256 (DE-599)BVBBV035880739 |
| discipline | Informatik |
| doi_str_mv | 10.1007/3-540-17629-2 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV035880739</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211008</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">091211s1987 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540176292</subfield><subfield code="9">3-540-17629-2</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387176292</subfield><subfield code="9">0-387-17629-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/3-540-17629-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)699823256</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035880739</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-12</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-Aug4</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-70</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-526</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-523</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Akman, Varol</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Unobstructed shortest paths in polyhedral environments</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">1987</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (103 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">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">Lecture notes in computer science</subfield><subfield code="v">251</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="650" ind1="0" ind2="7"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polyedergebiet</subfield><subfield code="0">(DE-588)4175160-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Polyedergebiet</subfield><subfield code="0">(DE-588)4175160-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="689" ind1="1" ind2="0"><subfield code="a">Polyeder</subfield><subfield code="0">(DE-588)4132101-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture notes in computer science</subfield><subfield code="v">251</subfield><subfield code="w">(DE-604)BV014880109</subfield><subfield code="9">251</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/3-540-17629-2</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-SLN</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-LNC</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-018738326</subfield></datafield></record></collection> |
| id | DE-604.BV035880739 |
| illustrated | Not Illustrated |
| indexdate | 2025-01-10T15:11:45Z |
| institution | BVB |
| isbn | 3540176292 0387176292 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-018738326 |
| oclc_num | 699823256 |
| open_access_boolean | |
| owner | DE-12 DE-634 DE-210 DE-Aug4 DE-M347 DE-860 DE-70 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-29 DE-739 DE-859 DE-1046 DE-706 DE-526 DE-521 DE-573 DE-523 |
| owner_facet | DE-12 DE-634 DE-210 DE-Aug4 DE-M347 DE-860 DE-70 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-29 DE-739 DE-859 DE-1046 DE-706 DE-526 DE-521 DE-573 DE-523 |
| physical | 1 Online-Ressource (103 S.) |
| psigel | ZDB-1-SLN ZDB-2-LNC |
| publishDate | 1987 |
| publishDateSearch | 1987 |
| publishDateSort | 1987 |
| publisher | Springer |
| record_format | marc |
| series | Lecture notes in computer science |
| series2 | Lecture notes in computer science |
| spelling | Akman, Varol Verfasser aut Unobstructed shortest paths in polyhedral environments Berlin [u.a.] Springer 1987 1 Online-Ressource (103 S.) txt rdacontent c rdamedia cr rdacarrier Lecture notes in computer science 251 Kürzester-Weg-Problem (DE-588)4138403-9 gnd rswk-swf Polyeder (DE-588)4132101-7 gnd rswk-swf Polyedergebiet (DE-588)4175160-7 gnd rswk-swf Polyedergebiet (DE-588)4175160-7 s Kürzester-Weg-Problem (DE-588)4138403-9 s DE-604 Polyeder (DE-588)4132101-7 s Lecture notes in computer science 251 (DE-604)BV014880109 251 https://doi.org/10.1007/3-540-17629-2 Verlag Volltext |
| spellingShingle | Akman, Varol Unobstructed shortest paths in polyhedral environments Lecture notes in computer science Kürzester-Weg-Problem (DE-588)4138403-9 gnd Polyeder (DE-588)4132101-7 gnd Polyedergebiet (DE-588)4175160-7 gnd |
| subject_GND | (DE-588)4138403-9 (DE-588)4132101-7 (DE-588)4175160-7 |
| title | Unobstructed shortest paths in polyhedral environments |
| title_auth | Unobstructed shortest paths in polyhedral environments |
| title_exact_search | Unobstructed shortest paths in polyhedral environments |
| title_full | Unobstructed shortest paths in polyhedral environments |
| title_fullStr | Unobstructed shortest paths in polyhedral environments |
| title_full_unstemmed | Unobstructed shortest paths in polyhedral environments |
| title_short | Unobstructed shortest paths in polyhedral environments |
| title_sort | unobstructed shortest paths in polyhedral environments |
| topic | Kürzester-Weg-Problem (DE-588)4138403-9 gnd Polyeder (DE-588)4132101-7 gnd Polyedergebiet (DE-588)4175160-7 gnd |
| topic_facet | Kürzester-Weg-Problem Polyeder Polyedergebiet |
| url | https://doi.org/10.1007/3-540-17629-2 |
| volume_link | (DE-604)BV014880109 |
| work_keys_str_mv | AT akmanvarol unobstructedshortestpathsinpolyhedralenvironments |