Characterizing rules in minimum cost spanning tree problems (Q1728385)
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: Characterizing rules in minimum cost spanning tree problems |
scientific article; zbMATH DE number 7027827
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing rules in minimum cost spanning tree problems |
scientific article; zbMATH DE number 7027827 |
Statements
Characterizing rules in minimum cost spanning tree problems (English)
0 references
22 February 2019
0 references
cost sharing
0 references
minimum cost spanning tree
0 references
monotonicity
0 references
rule
0 references
0 references
0.8767976760864258
0 references
0.849851131439209
0 references
0.8459981679916382
0 references
0.825302243232727
0 references
0.8159864544868469
0 references
