Sökning: onr:"swepub:oai:DiVA.org:ltu-26846" > Online routing in c...
Fältnamn | Indikatorer | Metadata |
---|---|---|
000 | 02959naa a2200409 4500 | |
001 | oai:DiVA.org:ltu-26846 | |
003 | SwePub | |
008 | 160930s2000 | |||||||||||000 ||eng| | |
024 | 7 | a https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-268462 URI |
024 | 7 | a https://doi.org/10.1007/3-540-40996-3_52 DOI |
040 | a (SwePub)ltu | |
041 | a engb eng | |
042 | 9 SwePub | |
072 | 7 | a ref2 swepub-contenttype |
072 | 7 | a kon2 swepub-publicationtype |
100 | 1 | a Bose, Prosenjitu School of Computer Science, Carleton University, Ottawa, Canada4 aut |
245 | 1 0 | a Online routing in convex subdivisions |
264 | c 2002-01-29 | |
264 | 1 | a Berlin :b Encyclopedia of Global Archaeology/Springer Verlag,c 2000 |
338 | a electronic2 rdacarrier | |
500 | a Godkänd; 2000; 20080313 (ysko) | |
520 | a We consider online routing algorithms for finding paths between the vertices of plane graphs. We show (1) there exists a routing algorithm for arbitrary triangulations that has no memory and uses no randomization, (2) no equivalent result is possible for convex subdivisions, (3) there is no competitive online routing algorithm under the Euclidean distance metric in arbitrary triangulations, and (4) there is no competitive online routing algorithm under the link distance metric even when the input graph is restricted to be a Delaunay, greedy, or minimum-weight triangulation. | |
650 | 7 | a NATURVETENSKAPx Data- och informationsvetenskapx Datavetenskap0 (SwePub)102012 hsv//swe |
650 | 7 | a NATURAL SCIENCESx Computer and Information Sciencesx Computer Sciences0 (SwePub)102012 hsv//eng |
700 | 1 | a Brodnik, Andreju Luleå tekniska universitet,IMFM, University of Ljubljana, Ljubljana, Slovenia4 aut0 (Swepub:ltu)brodnik |
700 | 1 | a Carlsson, Svanteu University of Karlskrona/Ronneby, Karlskrona, Sweden4 aut |
700 | 1 | a Demaine, Erik D.u Department of Computer Science, University of Waterloo, Waterloo, Canada4 aut |
700 | 1 | a Fleischer, Rudolfu Department of Computer Science, University of Waterloo, Waterloo, Canada4 aut |
700 | 1 | a López-Ortiz, Alejandrou Faculty of Computer Science, University of New Brunswick, Fredericton, Canada4 aut |
700 | 1 | a Morin, Patu School of Computer Science, Carleton University, Ottawa, Canada4 aut |
700 | 1 | a Munro, J. Ianu Department of Computer Science, University of Waterloo, Waterloo, Canada4 aut |
710 | 2 | a Luleå tekniska universitetb School of Computer Science, Carleton University, Ottawa, Canada4 org |
773 | 0 | t Algorithms and Computationd Berlin : Encyclopedia of Global Archaeology/Springer Verlagg , s. 47-59q <47-59z 3540412557 |
856 | 4 | u https://ltu.diva-portal.org/smash/get/diva2:1000026/FULLTEXT01.pdfx primaryx Raw objecty fulltext:print |
856 | 4 | u http://ltu.diva-portal.org/smash/get/diva2:1000026/FULLTEXT01 |
856 | 4 8 | u https://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-26846 |
856 | 4 8 | u https://doi.org/10.1007/3-540-40996-3_5 |
Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.
Kopiera och spara länken för att återkomma till aktuell vy