An application of the greedy heuristic of set cover to traffic checks (Q1022400)
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: An application of the greedy heuristic of set cover to traffic checks |
scientific article; zbMATH DE number 5567045
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of the greedy heuristic of set cover to traffic checks |
scientific article; zbMATH DE number 5567045 |
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
