Approximation algorithms for combinatorial problems. (English) Zbl 0296.65036


65K05 Numerical mathematical programming methods
68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
05A05 Permutations, words, matrices
05C15 Coloring of graphs and hypergraphs
Full Text: DOI


[1] Cook, S.A., The complexity of theorem-proving procedures, (), 151-158 · Zbl 0363.68125
[2] Garey, M.R.; Graham, R.L.; Ullman, J.D., Worst-case analysis of memory allocation algorithms, (), 143-150 · Zbl 0357.68027
[3] Graham, R.L., Bounds on multiprocessing anomalies and related packing algorithms, (), 205-217
[4] Johnson, D.S., Fast allocation algorithms, (), 144-154
[5] Johnson, D.S., Near-optimal bin packing algorithms, ()
[6] Karp, R.M., Reducibility among combinatorial problems, (), 85-104 · Zbl 0366.68041
[7] Matula, D.W.; Marble, G.; Issacson, J.D., Graph coloring algorithms, (), 109-122
[8] Sahni, S.K., On the knapsack and other computationally related problems, ()
[9] {\scJ. H. Spencer}, private communication.
[10] Welsh, D.J.A.; Powell, M.B., An upper bound to the chromatic number of a graph and its application to time-tabling problems, Comput. J., 10, 85-86, (1967) · Zbl 0147.15206
[11] Wood, D.C., A technique for coloring a graph applicable to large scale time-tabling problems, Comput. J., 12, 317-319, (1969) · Zbl 0193.53601
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.