An application of the greedy heuristic of set cover to traffic checks (Q1022400): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10100-008-0067-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077705663 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the ratio of optimal integral and fractional covers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the hardness of approximating minimization problems / rank | |||
Normal rank | |||
Latest revision as of 16:15, 1 July 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
