Pages that link to "Item:Q293334"
From MaRDI portal
The following pages link to An approximation algorithm for the maximum traveling salesman problem (Q293334):
Displaying 12 items.
- An improved approximation algorithm for the maximum TSP (Q974748) (← links)
- Improved deterministic approximation algorithms for max TSP (Q1041779) (← links)
- The lazy bureaucrat scheduling problem (Q1398377) (← links)
- An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices (Q1602709) (← links)
- Better approximations for max TSP (Q1607064) (← links)
- On lazy bureaucrat scheduling with common deadlines (Q2427440) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- An improved randomized approximation algorithm for Max TSP (Q2576776) (← links)
- Approximation algorithms for the scaffolding problem and its generalizations (Q2636507) (← links)
- Better Approximation Algorithms for Scaffolding Problems (Q4632165) (← links)
- An Approximation Algorithm for the Maximum Traveling Salesman Problem (Q4972196) (← links)
- THE MAXIMUM TRAVELING SALESMAN PROBLEM ON BANDED MATRICES (Q5249292) (← links)
