An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem (Q6168970)
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: An O(n^3)-time algorithm for the min-gap unit-length job scheduling problem |
scientific article; zbMATH DE number 7724769
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem |
scientific article; zbMATH DE number 7724769 |
Statements
An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem (English)
0 references
10 August 2023
0 references
scheduling algorithms
0 references
dynamic programming
0 references
amortized analysis
0 references
