Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Sven Oliver KrumkeLuigi LauraMaarten LipmannAlberto Marchetti-SpaccamelaWillem de PaepeDiana PoensgenLeen StougiePublished in: APPROX (2002)
Keyphrases
- maximum flow
- traveling salesman problem
- combinatorial optimization
- discrete particle swarm optimization
- minimum cut
- np hard
- ant colony optimization algorithm
- ant colony optimization
- objective function
- traveling salesman
- hamiltonian cycle
- minimum spanning tree
- directed graph
- simulated annealing
- dynamic programming
- k means
- optimization problems
- search space
- genetic algorithm
- push relabel