Intractability: a geometric representation

Authors:
Sami Khuri
Affiliations:
Department of Mathematics & Computer Science, San Joséé State University, One Washington Square, San José, CA
Venue:
SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
Year:
1994

Citing 5
Cited 0

A model curriculum for a liberal arts degree in computer science

Communications of the ACM - The MIT Press scientific computation series
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Curriculum '78: recommendations for the undergraduate program in computer science— a report of the ACM curriculum committee on computer science

Communications of the ACM
Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a geometric representation that can be applied to illustrate the complexity of some combinatorial optimization problems. In this work, it is applied to the 0/1 knapsack problem and to a special case of a scheduling problem. This representation gives insight into the difference between tractable and intractable problems. It can therefore be used as a stepping stone to compare polynomial (P) and nondeterministic polynomial (NP) problems, before venturing into the world of NP-completeness.