Earliest deadline first is a 2-approximation for DARP with time windows (Q6606221)
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: Earliest deadline first is a 2-approximation for DARP with time windows |
scientific article; zbMATH DE number 7914095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Earliest deadline first is a 2-approximation for DARP with time windows |
scientific article; zbMATH DE number 7914095 |
Statements
Earliest deadline first is a 2-approximation for DARP with time windows (English)
0 references
16 September 2024
0 references
approximation algorithms
0 references
deadline scheduling
0 references
dial-a-ride problems
0 references
0 references
0 references
