Information Bounds Are Weak in the Shortest Distance Problem (Q3930655): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q106189869, #quickstatements; #temporary_batch_1704836857466 |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Ronald L. Graham / rank | |||
| Property / author | |||
| Property / author: Ronald L. Graham / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/322203.322206 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2105310556 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:04, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Information Bounds Are Weak in the Shortest Distance Problem |
scientific article |
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
