Approximation algorithms for combinatorial problems
暂无分享,去创建一个
Simple, polynomial-time, heuristic algorithms for finding approximate solutions to various polynomial complete optimization problems are analyzed with respect to their worst case behavior, measured by the ratio of the worst solution value that can be chosen by the algorithm to the optimal value. For certain problems, such as a simple form of the knapsack problem and an optimization problem based on satisfiability testing, there are algorithms for which this ratio is bounded by a constant, independent of the problem size. For a number of set covering problems, simple algorithms yield worst case ratios which can grow with the log of the problem size. And for the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as 0(n&egr;), where n is the problem size and ε> 0 depends on the algorithm.
[1] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[2] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.
[3] D. J. A. Welsh,et al. An upper bound for the chromatic number of a graph and its application to timetabling problems , 1967, Comput. J..
[4] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[5] David S. Johnson,et al. Fast Allocation Algorithms , 1972, SWAT.