Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767)
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: Tight bounds for minimax grid matching with applications to the average case analysis of algorithms |
scientific article; zbMATH DE number 4125013
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tight bounds for minimax grid matching with applications to the average case analysis of algorithms |
scientific article; zbMATH DE number 4125013 |
Statements
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (English)
0 references
1989
0 references
minimax grid matching problem
0 references
average case analysis of algorithms
0 references
maximum up-right matching problem
0 references
upper bounds
0 references
dimensional bin packing
0 references
dimensional on-line bin packing
0 references
line dynamic allocation
0 references
0 references
0 references
0 references
0.8801112
0 references
0 references
0 references
0.86396563
0 references
0.8626594
0 references
0.8622675
0 references
0 references
