The NP-completeness column: An ongoing guide
- 30 June 1982
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 3 (2) , 182-195
- https://doi.org/10.1016/0196-6774(82)90018-9
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Colouring steiner quadruple systemsDiscrete Applied Mathematics, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- Covering Regions by RectanglesSIAM Journal on Algebraic Discrete Methods, 1981
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981
- Decomposing a polygon into its convex partsPublished by Association for Computing Machinery (ACM) ,1979
- On two-dimensional data organization I1Fundamenta Informaticae, 1979
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972