A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs

DOI10.1137/19M1304088zbMath1486.05294arXiv1707.02190MaRDI QIDQ5071089

Marcin Pilipczuk, Michał Pilipczuk, Dániel Marx

Publication date: 20 April 2022

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.02190

zbMATH Keywords

planar graphs; subexponential algorithm; subset TSP

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

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

90C27: Combinatorial optimization

05C10: Planar graphs; geometric and topological aspects of graph theory

05C85: Graph algorithms (graph-theoretic aspects)