Computational Complexity of Discrete Optimization Problems
- 1 January 1979
- book chapter
- Published by Elsevier in Annals of Discrete Mathematics
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- A Combinatorial Problem Which Is Complete in Polynomial SpaceJournal of the ACM, 1976
- The Complexity of Flowshop and Jobshop SchedulingMathematics of Operations Research, 1976
- An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on GraphsJournal of the ACM, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965