The k-Canadian Travelers Problem with Communication
From MaRDI portal
Publication:3004652
DOI10.1007/978-3-642-21204-8_6zbMath1329.90156OpenAlexW2101093996MaRDI QIDQ3004652
Publication date: 3 June 2011
Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21204-8_6
Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Online algorithms; streaming algorithms (68W27)
Related Items
Complexity of planning for connected agents in a partially known environment, The covering Canadian traveller problem, Online Strategies for Evacuating from a Convex Region in the Plane, An optimal randomized online algorithm for the \(k\)-Canadian traveller problem on node-disjoint paths
Cites Work