On the approximability of path and cycle problems in arc-dependent networks
From MaRDI portal
Publication:6102285
DOI10.1007/978-3-030-95018-7_23OpenAlexW4207058880MaRDI QIDQ6102285
Alvaro Velasquez, K. Subramani and Vahan Mkrtchyan, Matthew Williamson, Piotr J. Wojciechowski
Publication date: 8 May 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-95018-7_23
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Some consequences of non-uniform conditions on uniform classes
- Special cases of the quadratic shortest path problem
- On finding shortest paths in arc-dependent networks
- On Solving the Quadratic Shortest Path Problem
- Color-coding
- Kernelization
- On the approximability of the maximum common subgraph problem
- Parameterized Algorithms
- On finding minimum routes in a network with turn penalties