Collision-free routing problem with restricted L-path

DOI10.1007/978-3-319-94667-2_1MaRDI QIDQ1670977zbMATH OpenOpenAlexFDO

Authors Jammigumpula Ajay, Sasanka Roy

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94667-2_1

zbMATH Keywords

approximation algorithmcollision-freemaximum independent setL-graphsco-comparable graph

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Collision-free routing problem with restricted L-path
• The complexity of routing with collision avoidance
• The complexity of routing with few collisions
• Approximation Algorithms for Conflict-Free Vehicle Routing
• Problems on one way road networks

Cited in

(3)

• The complexity of routing with few collisions
• The complexity of routing with collision avoidance
• Collision-free routing problem with restricted L-path

This page was built for publication: Collision-free routing problem with restricted L-path

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