Approximation algorithms for combinatorial problems
David S. Johnson · Journal of Computer and System Sciences · 1974
Cited by 2,197 works. doi:10.1016/s0022-0000(74)80044-9 Open-access PDF
Authors
References
- Reducibility among Combinatorial Problems
- The complexity of theorem-proving procedures
- Complexity of Computer Computations
- Proceedings of the 56th Annual ACM Symposium on Theory of Computing
- Graph Theory and Computing
- GRAPH COLORING ALGORITHMS††This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under contract SD-302 and by the National Science Foundation under contract GJ-446.
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- Bounds on multiprocessing anomalies and related packing algorithms
- Worst-case analysis of memory allocation algorithms
- Near-optimal bin packing algorithms