A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
From MaRDI portal
Publication:1917344
DOI10.1016/0166-218X(95)00054-UzbMath0848.90117MaRDI QIDQ1917344
Publication date: 5 August 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items (33)
An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ On the uniform edge-partition of a tree ⋮ A subexponential algorithm for the coloured tree partition problem ⋮ Min-Max vs. Min-Sum vehicle routing: a worst-case analysis ⋮ An overview of graph covering and partitioning ⋮ Energy-Optimal Broadcast in a Tree with Mobile Agents ⋮ Approximating the minmax rooted-tree cover in a tree ⋮ A decomposition based solution algorithm for U-type assembly line balancing with interval data ⋮ \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective ⋮ Computing without communicating: ring exploration by asynchronous oblivious robots ⋮ EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN ⋮ The ANTS problem ⋮ Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints ⋮ Balancing profits and costs on trees ⋮ A min-max vehicle routing problem with split delivery and heterogeneous demand ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. ⋮ How many oblivious robots can explore a line ⋮ Unnamed Item ⋮ Searching for a black hole in arbitrary networks: optimal mobile agents protocols ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Gossiping by energy-constrained mobile agents in tree networks ⋮ Remembering without memory: tree exploration by asynchronous oblivious robots ⋮ Locating and repairing faults in a network with mobile agents ⋮ Approximation hardness of min-max tree covers ⋮ Minmax subtree cover problem on cacti ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ Minmax Tree Cover in the Euclidean Space ⋮ Approximation results for a min-max location-routing problem ⋮ Communication Problems for Mobile Agents Exchanging Energy ⋮ A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree ⋮ Energy-optimal broadcast and exploration in a tree using mobile agents ⋮ A tight lower bound for semi-synchronous collaborative grid exploration ⋮ Convergecast and broadcast by power-aware mobile agents
Cites Work
This page was built for publication: A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
