Pages that link to "Item:Q1917344"

The following pages link to A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree (Q1917344):

Displaying 33 items.

• Convergecast and broadcast by power-aware mobile agents (Q261352) (← links)
• A decomposition based solution algorithm for U-type assembly line balancing with interval data (Q337547) (← links)
• A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
• Approximation results for a min-max location-routing problem (Q765374) (← links)
• Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
• Locating and repairing faults in a network with mobile agents (Q962168) (← links)
• Approximation hardness of min-max tree covers (Q974986) (← links)
• \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767) (← links)
• 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
• A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
• How many oblivious robots can explore a line (Q1944194) (← links)
• Searching for a black hole in arbitrary networks: optimal mobile agents protocols (Q1954192) (← links)
• Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
• A tight lower bound for semi-synchronous collaborative grid exploration (Q2220396) (← links)
• Energy-optimal broadcast and exploration in a tree using mobile agents (Q2330122) (← links)
• On the uniform edge-partition of a tree (Q2370420) (← links)
• A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
• Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
• Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
• The ANTS problem (Q2401118) (← links)
• Minmax subtree cover problem on cacti (Q2495907) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• Communication Problems for Mobile Agents Exchanging Energy (Q2835031) (← links)
• EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616) (← links)
• Energy-Optimal Broadcast in a Tree with Mobile Agents (Q5056056) (← links)
• A tight lower bound for semi-synchronous collaborative grid exploration (Q5090903) (← links)
• Balancing profits and costs on trees (Q5326788) (← links)
• (Q5881545) (← links)
• Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
• Time versus cost tradeoffs for deterministic rendezvous in networks (Q5964898) (← links)