The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1137/050629276 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030606633 / rank | |||
Normal rank |
Latest revision as of 19:14, 19 March 2024
scientific article; zbMATH DE number 5255566
Language | Label | Description | Also known as |
---|---|---|---|
English | The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes |
scientific article; zbMATH DE number 5255566 |
Statements
The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (English)
0 references
28 March 2008
0 references
independent set
0 references
geometric intersection graphs
0 references
rectangle graphs
0 references