Competitive online routing in geometric graphs
type: Item
instance of: scholarly article
title: Competitive online routing in geometric graphs
zbMATH Open document ID: 1073.68059
author: Prosenjit Bose
author: Pat Morin
published in: Theoretical Computer Science
publication date: 2004-11-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2118368
zbMATH Keywords: Online routing
zbMATH Keywords: Competitive routing
zbMATH Keywords: Geometric graph
zbMATH Keywords: Minimum weight triangulation
zbMATH Keywords: Delaunay triangulation
zbMATH Keywords: Greedy triangulation
zbMATH Keywords: Spanner
zbMATH Keywords: Spanning ratio
zbMATH Keywords: Planar graph
zbMATH Keywords: Good polygon
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.05.019
OpenAlex ID: W2119251691
cites work: Searching in the plane
cites work: Q4834367
cites work: Q4223058
cites work: ONLINE ROUTING IN CONVEX SUBDIVISIONS
cites work: Q4411362
cites work: Online Routing in Triangulations
cites work: Q3484375
cites work: Delaunay graphs are almost as good as complete graphs
cites work: Constructing competitive tours from local information
cites work: Shortest paths without a map
DOI: 10.1016/J.TCS.2004.05.019
description: scientific article; zbMATH DE number 2118368