Sökning: id:"swepub:oai:DiVA.org:mau-49961" >
Local Routing in Sp...
-
Ashvinkumar, VikrantUniv Sydney, Sydney, NSW, Australia.,University of Sydney
(författare)
Local Routing in Sparse and Lightweight Geometric Graphs
- Artikel/kapitelEngelska2022
Förlag, utgivningsår, omfång ...
-
2022-01-25
-
Springer,2022
-
electronicrdacarrier
Nummerbeteckningar
-
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
Kompletterande språkuppgifter
-
Språk:engelska
-
Sammanfattning på:engelska
Ingår i deldatabas
Klassifikation
-
Ämneskategori:ref swepub-contenttype
-
Ämneskategori:art swepub-publicationtype
Anmärkningar
-
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.
Ämnesord och genrebeteckningar
Biuppslag (personer, institutioner, konferenser, titlar ...)
-
Gudmundsson, JoachimUniv Sydney, Sydney, NSW, Australia.,University of Sydney(Swepub:lu)csz-jmg
(författare)
-
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
(författare)
-
Nilsson, Bengt J.Malmö University,Malmö universitet,Institutionen för datavetenskap och medieteknik (DVMT)(Swepub:mau)tsbeni
(författare)
-
van Renssen, AndreUniv Sydney, Sydney, NSW, Australia.,University of Sydney
(författare)
-
Univ Sydney, Sydney, NSW, Australia.University of Sydney
(creator_code:org_t)
Sammanhörande titlar
-
Ingår i:Algorithmica: Springer84, s. 1316-13400178-46171432-0541
Internetlänk
Hitta via bibliotek
Till lärosätets databas