Approximation algorithms for combinatorial problems
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] David C. Wood,et al. A technique for colouring a graph applicable to large scale timetabling problems , 1969, Computer/law journal.
[3] Sartaj Kumar Sahni,et al. On The Knapsack And Other Computationally Related Problems , 1973 .
[4] Ronald L. Graham,et al. Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).
[5] David S. Johnson,et al. Fast Allocation Algorithms , 1972, SWAT.
[6] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[7] David S. Johnson,et al. Near-optimal bin packing algorithms , 1973 .
[8] 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..
[9] Richard M. Karp,et al. Reducibility among combinatorial problems" in complexity of computer computations , 1972 .
[10] Jeffrey D. Ullman,et al. Worst-case analysis of memory allocation algorithms , 1972, STOC.