Approximative Algorithms for Discrete Optimization Problems
- 1 January 1979
- book chapter
- Published by Elsevier in Annals of Discrete Mathematics
Abstract
No abstract availableThis publication has 48 references indexed in Scilit:
- Fast algorithms for bin packingPublished by Elsevier ,2007
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- A nonlinear lower bound on linear search tree programs for solving knapsack problemsJournal of Computer and System Sciences, 1976
- On the complexity of edge traversingJournal of the ACM, 1976
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Canonical Coin Changing and Greedy SolutionsJournal of the ACM, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- A Polynomial-Time Algorithm for the Knapsack Problem with Two VariablesJournal of the ACM, 1976
- AlgorithmsAdvances in Mathematics, 1975
- Kruskal's theorem for matroidsMathematical Proceedings of the Cambridge Philosophical Society, 1968