Empirical study of the greedy heuristic as applied to the link selection problem (Q2516854): 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.1515/ausi-2015-0014 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2297775320 / 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: 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: An application of the greedy heuristic of set cover to traffic checks / rank | |||
Normal rank | |||
Latest revision as of 14:33, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Empirical study of the greedy heuristic as applied to the link selection problem |
scientific article |
Statements
Empirical study of the greedy heuristic as applied to the link selection problem (English)
0 references
4 August 2015
0 references
link selection
0 references
greedy algorithm
0 references
binary integer programming
0 references
traffic check
0 references
