TY - GEN
T1 - How to Catch Marathon Cheaters
T2 - 17th International Symposium on Algorithms and Data Structures, WADS 2021
AU - Goodrich, Michael T.
AU - Gupta, Siddharth
AU - Khodabandeh, Hadi
AU - Matias, Pedro
N1 - Publisher Copyright:
© 2021, Springer Nature Switzerland AG.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - Given an undirected graph, G, and vertices, s and t in G, the tracking paths problem is that of finding the smallest subset of vertices in G whose intersection with any s-t path results in a unique sequence. This problem is known to be NP-complete and has applications to animal migration tracking and detecting marathon course-cutting, but its approximability is largely unknown. In this paper, we address this latter issue, giving novel algorithms having approximation ratios of (1 + ϵ), O(lg OPT) and O(lg n), for H-minor-free, general, and weighted graphs, respectively. We also give a linear kernel for H-minor-free graphs.
AB - Given an undirected graph, G, and vertices, s and t in G, the tracking paths problem is that of finding the smallest subset of vertices in G whose intersection with any s-t path results in a unique sequence. This problem is known to be NP-complete and has applications to animal migration tracking and detecting marathon course-cutting, but its approximability is largely unknown. In this paper, we address this latter issue, giving novel algorithms having approximation ratios of (1 + ϵ), O(lg OPT) and O(lg n), for H-minor-free, general, and weighted graphs, respectively. We also give a linear kernel for H-minor-free graphs.
KW - Approximation algorithms
KW - Fixed-parameter tractability
KW - Graph algorithms
KW - Graph minor
KW - Kernelization
KW - Minor-free graphs
KW - Road networks
UR - http://www.scopus.com/inward/record.url?scp=85113564002&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-83508-8_32
DO - 10.1007/978-3-030-83508-8_32
M3 - Conference contribution
AN - SCOPUS:85113564002
SN - 9783030835071
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 442
EP - 456
BT - Algorithms and Data Structures - 17th International Symposium, WADS 2021, Proceedings
A2 - Lubiw, Anna
A2 - Salavatipour, Mohammad
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 9 August 2021 through 11 August 2021
ER -