Problems on One Way Road Networks

DOI10.7155/jgaa.00544zbMath1446.05084OpenAlexW3097282034MaRDI QIDQ5131228

Avinandan Das, Arindam Karmakar, Binayak Dutta, Navaneeta Saikia, Jammigumpula Ajay, Sasanka Roy

Publication date: 5 November 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00544

zbMATH Keywords

shortest pathdirected graphsindependent setstraffic configuration

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Survey of research in the design and control of automated guided vehicle systems
• Conflict-free shortest-time bidirectional AGV routeing
• On the Complexity of an Unregulated Traffic Crossing
• Scheduling and routing algorithms for AGVs: A survey
• A Theorem on Graphs, with an Application to a Problem of Traffic Control