An application of the greedy heuristic of set cover to traffic checks (Q1022400): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of the greedy heuristic of set cover to traffic checks |
scientific article |
Statements
An application of the greedy heuristic of set cover to traffic checks (English)
0 references
22 June 2009
0 references
set cover
0 references
greedy heuristic
0 references
traffic checks
0 references
traffic assignment
0 references
shortest paths
0 references
