Introduction to routing problems with mandatory transitions

DOI10.1007/978-3-031-23101-8_17OpenAlexW4313429644MaRDI QIDQ6169531

Timothée Martinod, Christian Laforest

Publication date: 14 August 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-23101-8_17

zbMATH Keywords

complexityshortest pathdirected graphrouting problemobligation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• Domination problems with no conflicts
• On the complexity of independent dominating set with obligations in graphs
• Graph problems with obligations
• Finding Paths in Grids with Forbidden Transitions
• An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
• Some Hamiltonian Properties of One-Conflict Graphs

This page was built for publication: Introduction to routing problems with mandatory transitions