An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem (Q3439461)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5158285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem |
scientific article; zbMATH DE number 5158285 |
Statements
An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem (English)
0 references
29 May 2007
0 references
graph
0 references
constrained kSP
0 references
deviation algorithms
0 references
downstream logistics
0 references
