Random sampling and greedy sparsification for matroid optimization problems (Q1290633)
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: Random sampling and greedy sparsification for matroid optimization problems |
scientific article; zbMATH DE number 1294684
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random sampling and greedy sparsification for matroid optimization problems |
scientific article; zbMATH DE number 1294684 |
Statements
Random sampling and greedy sparsification for matroid optimization problems (English)
0 references
3 June 1999
0 references
random sampling
0 references
matroid basis
0 references
matroid partitioning
0 references
combinatorial optimization
0 references
minimum spanning trees
0 references
minimum cuts
0 references
greedy algorithm
0 references
network reliability
0 references
0 references
0 references
0.7763848900794983
0 references
0.7721842527389526
0 references
0.7621869444847107
0 references
0.7621867656707764
0 references
