Optimal packing and covering in the plane are NP-complete
- 1 June 1981
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 12 (3) , 133-137
- https://doi.org/10.1016/0020-0190(81)90111-3
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Intersection graphs of curves in the planeJournal of Combinatorial Theory, Series B, 1976
- Algorithmic Aspects of Vertex Elimination on GraphsSIAM Journal on Computing, 1976