Competitive local routing with constraints

DOI10.1007/978-3-662-48971-0_3zbMATH Open1472.68202OpenAlexW8202075MaRDI QIDQ3459846FDOQ3459846

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

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://jocg.org/index.php/jocg/article/view/3033

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 (6)

• Routing on the visibility graph
• Routing in polygonal domains
• Competitive routing in the half-\(\theta_6\)-graph
• Constrained routing between non-visible vertices
• Competitive local routing with constraints
• Competitive routing over time

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 Q3459846)