Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions (Q528547)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6715079
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions |
scientific article; zbMATH DE number 6715079 |
Statements
Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions (English)
0 references
12 May 2017
0 references
cooperative game
0 references
minimum spanning tree
0 references
Shapley value
0 references
computational complexity
0 references
submodular function
0 references
0 references
0.8157762885093689
0 references
0.7824876308441162
0 references
0.7728806734085083
0 references
0.770210862159729
0 references
0.7627400755882263
0 references
