The following pages link to (Q3801366):
Displayed 7 items.
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles (Q2396372) (← links)
- Asymptotically optimal algorithms for geometric MAX TSP and MAX \(m\)-PSP (Q2434738) (← links)
- On finding a cyclic tour and a vehicle loading plan yielding maximum profit (Q4242569) (← links)