Collision-free routing problem with restricted L-path

DOI10.1016/j.dam.2021.04.013zbMath1495.90013MaRDI QIDQ2161235

Sasanka Roy, Satyabrata Jana, Jammigumpula Ajay

Publication date: 4 August 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.04.013

zbMATH Keywords

approximation algorithm; maximum independent set; collision-free; co-comparable graphs; unit-L graphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

90B06: Transportation, logistics and supply chain management

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms