Map partitioning for accelerated routing: measuring relation between tiled and routing partitions

DOI10.1007/978-3-319-42902-1_30zbMATH Open1375.90029OpenAlexW2594439036MaRDI QIDQ4596218FDOQ4596218

Authors: Maximilian Adam, Natalia Kliewer, Felix G. König 

Publication date: 1 December 2017

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42902-1_30

Recommendations

• Partitioning graphs to speedup Dijkstra's algorithm
• Experimental and Efficient Algorithms
• GOOD NEWS: PARTITIONING A SIMPLE POLYGON BY COMPASS DIRECTIONS
• Comparing directed and weighted road maps
• Relations Between Two Common Types of Rectangular Tilings

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

This page was built for publication: Map partitioning for accelerated routing: measuring relation between tiled and routing partitions

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