Approximation algorithms for combinatorial problems

References

Page 1

	Year	Citations
The complexity of theorem-proving procedures Stephen Cook EngineeringVerificationAutomated ProofComputational ComplexityRecognition Problem	1971	6.1K
An upper bound for the chromatic number of a graph and its application to timetabling problems Dominic Welsh The Computer Journal Mathematical ProgrammingEngineeringPlanar GraphComputational ComplexityStructural Graph Theory	1967	754
Proceedings of the 43rd annual ACM symposium on Theory of computing Lance Fortnow, Salil Vadhan Theory Of ComputingComputational Complexity TheoryEngineeringAnnual Acm SymposiumComputational Complexity	2011	361
Worst-case analysis of memory allocation algorithms M. R. Garey, Ronald Graham, Jeffrey D. Ullman Mathematical ProgrammingEngineeringComputer ArchitectureAnalysis Of AlgorithmComputational Complexity	1972	181
Bounds on multiprocessing anomalies and related packing algorithms Ronald Graham Computational Complexity TheoryEngineeringComputer ArchitectureComputational ComplexityMultithreading (Computer Architecture)	1971	108
A technique for colouring a graph applicable to large scale timetabling problems David C. Wood The Computer Journal Mathematical ProgrammingEngineeringComputational ComplexityOperations ResearchSystems Engineering	1969	92
Fast allocation algorithms D. S. Johnson EngineeringComputer ArchitectureAnalysis Of AlgorithmComputational ComplexityAlgorithm Implementation	1972	27
On the knapsack and other computationally related problems. Sartaj Sahni Mathematical ProgrammingEngineeringInteger OptimizationCombinatorial ProblemDiscrete Optimization	1973	10

Page 1