Pages that link to "Item:Q1363767"
From MaRDI portal
The following pages link to \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective (Q1363767):
Displaying 22 items.
- 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)
- A note on the minimum bounded edge-partition of a tree (Q967344) (← links)
- Approximation hardness of min-max tree covers (Q974986) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- Complexity of robust single facility location problems on networks with uncertain edge lengths. (Q1811071) (← 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)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- A subexponential algorithm for the coloured tree partition problem (Q2370434) (← links)
- Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
- The ANTS problem (Q2401118) (← links)
- Map construction of unknown graphs by multiple agents (Q2456354) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover (Q2699031) (← links)
- EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN (Q2929616) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- (Q5881545) (← links)