Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds |
scientific article; zbMATH DE number 5201881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds |
scientific article; zbMATH DE number 5201881 |
Statements
Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (English)
0 references
18 October 2007
0 references
shortest path problem
0 references
0 references
0 references
0.874659538269043
0 references
0.8716932535171509
0 references
0.8379726409912109
0 references
