Online routing in convex subdivisions

DOI10.1007/3-540-40996-3_5MaRDI QIDQ4472479zbMATH OpenFDO

Authors Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Pat Morin, J. Ian Munro, Alejandro Lopez-Ortiz

Publication date 4 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690047.htm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• Online Routing in Triangulations
• Online routing in triangulations
• Competitive online routing in geometric graphs
• Upper and lower bounds for online routing on Delaunay triangulations

Cited in

(10)

• Constant memory routing in quasi-planar and quasi-polyhedral graphs
• Hybrid grids and the Homing robot
• Competitive online routing in geometric graphs
• The subdivision-constrained routing requests problem
• Memoryless routing in convex subdivisions: random walks are optimal
• Online routing in triangulations
• Online Routing in Triangulations
• ONLINE ROUTING IN CONVEX SUBDIVISIONS
• Local routing in convex subdivisions
• Local routing in convex subdivisions

This page was built for publication: Online routing in convex subdivisions

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