onr:"swepub:oai:DiVA.org:mau-49961"
Search: onr:"swepub:oai:DiVA.org:mau-49961" > Local Routing in Sp...
- 1 of 1
- Previous record
- Next record
- To hitlist
- Ashvinkumar, VikrantUniv Sydney, Sydney, NSW, Australia.,University of Sydney (author)
Local Routing in Sparse and Lightweight Geometric Graphs
- Article/chapterEnglish2022
Publisher, publication year, extent ...
- 2022-01-25
- Springer,2022
- electronicrdacarrier
Numbers
- LIBRIS-ID:oai:DiVA.org:mau-49961
- https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-49961URI
- https://doi.org/10.1007/s00453-022-00930-2DOI
- https://lup.lub.lu.se/record/0a4370b8-879d-431d-868f-2985b0dbcfb7URI
Supplementary language notes
- Language:English
- Summary in:English
Part of subdatabase
- SwePubSwePub
Classification
Notes
- Online routing in a planar embedded graph is central to a number of fields and has been studied extensively in the literature. For most planar graphs no O (1)-competitive online routing algorithm exists. A notable exception is the Delaunay triangulation for which Bose and Morin (SIAM J Comput 33(4):937-951, 2004) showed that there exists an online routing algorithm that is O(1)-competitive. However, a Delaunay triangulation can have Omega (n) vertex degree and a total weight that is a linear factor greater than the weight of a minimum spanning tree. We show a simple construction, given a set V of n points in the Euclidean plane, of a planar geometric graph on V that has small weight (within a constant factor of the weight of a minimum spanning tree on V), constant degree, and that admits a local routing strategy that is O (1)-competitive. Moreover, the technique used to bound the weight works generally for any planar geometric graph whilst preserving the admission of an O (1)-competitive routing strategy.
Subject headings and genre
- NATURVETENSKAP Data- och informationsvetenskap Datavetenskap hsv//swe
- NATURAL SCIENCES Computer and Information Sciences Computer Sciences hsv//eng
- Computational geometry
- Spanners
- Routing
Added entries (persons, corporate bodies, meetings, titles ...)
- Gudmundsson, JoachimUniv Sydney, Sydney, NSW, Australia.,University of Sydney(Swepub:lu)csz-jmg (author)
- Levcopoulos, ChristosLund University,Lunds universitet,Institutionen för datavetenskap,Institutioner vid LTH,Lunds Tekniska Högskola,Naturvetenskapliga fakulteten,Department of Computer Science,Departments at LTH,Faculty of Engineering, LTH,Faculty of Science(Swepub:lu)cs-cle (author)
- Nilsson, Bengt J.Malmö University,Malmö universitet,Institutionen för datavetenskap och medieteknik (DVMT)(Swepub:mau)tsbeni (author)
- van Renssen, AndreUniv Sydney, Sydney, NSW, Australia.,University of Sydney (author)
- Univ Sydney, Sydney, NSW, Australia.University of Sydney (creator_code:org_t)
Related titles
- In:Algorithmica: Springer84, s. 1316-13400178-46171432-0541
Internet link
- https://doi.org/10.1007/s00453-022-00930-2Fulltext
- https://mau.diva-portal.org/smash/get/diva2:1635479/FULLTEXT01.pdffulltext:print
- https://link.springer.com/content/pdf/10.1007/s00453-022-00930-2.pdf
- http://dx.doi.org/10.1007/s00453-022-00930-2FULLTEXT
- https://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-49961
- https://doi.org/10.1007/s00453-022-00930-2
- https://lup.lub.lu.se/record/0a4370b8-879d-431d-868f-2985b0dbcfb7
- 1 of 1
- Previous record
- Next record
- To hitlist
Find more in SwePub
- By the author/editor
- Ashvinkumar, Vik ...
- Gudmundsson, Joa ...
- Levcopoulos, Chr ...
- Nilsson, Bengt J ...
- van Renssen, And ...
- About the subject
-
- NATURAL SCIENCES
- NATURAL SCIENCES
- and Computer and Inf ...
- and Computer Science ...
- Articles in the publication
- Algorithmica
- By the university
- Malmö 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
