Optimal packing and covering in the plane are NP-complete (Q1157170): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection graphs of curves in the plane / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5568974 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank | |||
Normal rank |
Latest revision as of 12:54, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal packing and covering in the plane are NP-complete |
scientific article |
Statements
Optimal packing and covering in the plane are NP-complete (English)
0 references
1981
0 references
intersection graph
0 references
geometric algorithms
0 references
image processing
0 references
computer graphics
0 references
circuit layout
0 references
scheduling
0 references
0 references