Extending the quadrangle inequality to speed-up dynamic programming (Q1321816)
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: Extending the quadrangle inequality to speed-up dynamic programming |
scientific article; zbMATH DE number 561598
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Extending the quadrangle inequality to speed-up dynamic programming |
scientific article; zbMATH DE number 561598 |
Statements
Extending the quadrangle inequality to speed-up dynamic programming (English)
0 references
3 May 1994
0 references
rectilinear Steiner minimal arborescence
0 references
dynamic programming
0 references
quadrangle inequality
0 references
0.86841846
0 references
0.85168076
0 references
0.84898895
0 references
0.84863114
0 references
0 references
0.8461962
0 references
