A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs

DOI10.1007/978-3-031-34347-6_8OpenAlexW4379118138MaRDI QIDQ6182894

Roberto Solis-Oba, Andrew Bloch-Hansen, Daniel R. Page

Publication date: 22 December 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-34347-6_8

zbMATH Keywords

dynamic programmingapproximation algorithmknapsack problemapproximation schemethief orienteering problem

Mathematics Subject Classification ID

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

Cites Work

• Orienteering problem: a survey of recent variants, solution approaches and applications
• On approximating the longest path in a graph
• The packing while traveling problem
• Attractive orienteering problem with proximity and timing interactions
• Efficiently solving the thief orienteering problem with a max-min ant colony optimization approach
• Ants can orienteer a thief in their robbery
• The orienteering problem
• Analysis of baseline evolutionary algorithms for the packing while travelling problem

This page was built for publication: A polynomial-time approximation scheme for thief orienteering on directed acyclic graphs