SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "onr:"swepub:oai:DiVA.org:ltu-12613" "

Search: onr:"swepub:oai:DiVA.org:ltu-12613"

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Bose, Prosenjit, et al. (author)
  • Online routing in convex subdivisions
  • 2002
  • In: International journal of computational geometry and applications. - 0218-1959. ; 12:4, s. 283-295
  • Journal article (peer-reviewed)abstract
    • 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.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Brodnik, Andrej (1)
Bose, Prosenjit (1)
Carlsson, Svante (1)
Demaine, Erik D. (1)
Fleischer, Rudolf (1)
López-Ortiz, Alejand ... (1)
show more...
Morin, Pat (1)
Munro, J. Ian (1)
show less...
University
Luleå University of Technology (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2002 (1)

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.

 
pil uppåt Close

Copy and save the link in order to return to this view