Information Bounds Are Weak in the Shortest Distance Problem (Q3930655)
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 3746451
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Information Bounds Are Weak in the Shortest Distance Problem |
scientific article; zbMATH DE number 3746451 |
Statements
Information Bounds Are Weak in the Shortest Distance Problem (English)
0 references
1980
0 references
realizable patterns
0 references
decision tree model
0 references
Farkas lemma
0 references
lower bound
0 references
maximum flow
0 references
polyhedron
0 references
shortest path
0 references
