Efficient Algorithms for Fixed-Precision Instances of Bin Packing and Euclidean TSP.

David R. Karger Jacob Scott

Published in: APPROX-RANDOM (2008)

Keyphrases

bin packing
graph colouring
traveling salesman problem
assembly line balancing
multiple knapsack
search tree
packing problem
combinatorial optimization
search space
cutting stock
optimization problems
travelling salesman
database systems
memetic algorithm
np hard
search algorithm
optimal solution