Competitive local routing with constraints

DOI10.20382/JOCG.V8I1A7zbMATH Open1476.68275arXiv1412.0760MaRDI QIDQ5745388FDOQ5745388

Authors: Prosenjit Bose, Rolf Fagerberg, André van Renssen, Sander Verdonschot 

Publication date: 5 June 2018

Full work available at URL: https://arxiv.org/abs/1412.0760

Recommendations

• Competitive local routing with constraints
• Routing on the Visibility Graph
• Routing on the visibility graph

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (8)

• Routing on the visibility graph
• Routing among convex polygonal obstacles in the plane
• Routing in polygonal domains
• Competitive routing in the half-\(\theta_6\)-graph
• Bounded-degree spanners in the presence of polygonal obstacle
• Competitive local routing with constraints
• Routing among convex polygonal obstacles in the plane
• Construction and Local Routing for Angle-Monotone Graphs

This page was built for publication: Competitive local routing with constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745388)