The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296)
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: The S-digraph optimization problem and the greedy algorithm |
scientific article; zbMATH DE number 5560501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \(S\)-digraph optimization problem and the greedy algorithm |
scientific article; zbMATH DE number 5560501 |
Statements
The \(S\)-digraph optimization problem and the greedy algorithm (English)
0 references
2 June 2009
0 references
greedy algorithm
0 references
matroids
0 references
Huffman codes
0 references
data compression
0 references
0 references
0 references
0 references
0.8059777021408081
0 references
0.8022068738937378
0 references
0.8022068738937378
0 references
0.8013174533843994
0 references
