id:"swepub:oai:lup.lub.lu.se:7b2840ab-fcad-4643-9206-12687648ef68"
Search: id:"swepub:oai:lup.lub.lu.se:7b2840ab-fcad-4643-9206-12687648ef68" > Approximate distanc...
- 1 of 1
- Previous record
- Next record
- To hitlist
- Gudmundsson, J (author)
Approximate distance oracles revisited
- Article/chapterEnglish2002
Publisher, publication year, extent ...
- 2002
Numbers
- LIBRIS-ID:oai:lup.lub.lu.se:7b2840ab-fcad-4643-9206-12687648ef68
- https://lup.lub.lu.se/record/311041URI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- Let G be a geometric t-spanner in E-d with n vertices and m edges, where t is a constant. We show that G can be preprocessed in O(m log n) time, such that (1 + epsilon)-approximate shortest-path queries in G can be answered in O(1) time. The data structure uses O(n log n) space.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
- Levcopoulos, ChristosLund University,Lunds universitet,Data Vetenskap,Naturvetenskapliga fakulteten,Computer Science,Faculty of Science(Swepub:lu)cs-cle (author)
- Narasimhan, G (author)
- Smid, M (author)
- Data VetenskapNaturvetenskapliga fakulteten (creator_code:org_t)
Related titles
- In:Algorithms and Computation, Proceedings / Lecture Notes in Computer Science2518, s. 357-3680302-97431611-3349
Internet link
Find in a library
- Algorithms and Computation, Proceedings / Lecture Notes in Computer Science (Search for host publication in LIBRIS)
To the university's database
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Gudmundsson, J
- Levcopoulos, Chr ...
- Narasimhan, G
- Smid, M
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- Articles in the publication
- Algorithms and C ...
- By the university
- Lund University
Search outside SwePub
- Extend your search to:
- Google Book Search
- Google Scholar
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.
- Copyright © LIBRIS - National Library Systems
- LIBRIS.kb.se
