The k-Canadian travelers problem with communication

DOI10.1007/S10878-012-9503-XMaRDI QIDQ2392736zbMATH OpenOpenAlexFDO

Authors Huili Zhang, Lan Qin, Yinfeng Xu

Publication date 2 August 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9503-x

zbMATH Keywords

communicationcompetitive analysisonline \(k\)-CTP

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Recommendations

• The \(k\)-Canadian travelers problem with communication
• Multiple canadians on the road: minimizing the distance competitive ratio
• On the online multi-agent O-D \(k\)-Canadian traveler problem
• A note on the \(k\)-Canadian traveller problem
• On the randomized online strategies for the \(k\)-Canadian traveler problem

Cites work

• scientific article; zbMATH DE number 432827 (Why is no real title available?)
• scientific article; zbMATH DE number 2134682 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A note on the \(k\)-Canadian traveller problem
• Adaptive Source Routing in High-Speed Networks
• Shortest paths without a map
• The Canadian Traveller Problem and its competitive analysis

Cited in

(14)

• Online covering salesman problem
• The \(k\)-Canadian travelers problem with communication
• Weighted online minimum latency problem with edge uncertainty
• The Steiner traveling salesman problem with online edge blockages
• The Steiner traveling salesman problem with online advanced edge blockages
• How much the grid network and rescuers' communication can improve the rescue efficiency in worst-case analysis
• On the online multi-agent O-D \(k\)-Canadian traveler problem
• On the randomized online strategies for the \(k\)-Canadian traveler problem
• Approximating the Canadian traveller problem with online randomization
• Competitive analysis of randomized online strategies for the multi-agent \(k\)-Canadian traveler problem
• Fibonacci helps to evacuate from a convex region in a grid network
• An online optimization approach for post-disaster relief distribution with online blocked edges
• Multiple canadians on the road: minimizing the distance competitive ratio
• Optimal shortest path set problem in undirected graphs

This page was built for publication: The \(k\)-Canadian travelers problem with communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392736)