Activity selection games and the minimum‐cut problem (Q4740362): 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.1002/net.3230130106 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2128805075 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5817870 / rank | |||
Normal rank | |||
Latest revision as of 17:00, 13 June 2024
scientific article; zbMATH DE number 3795720
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Activity selection games and the minimum‐cut problem |
scientific article; zbMATH DE number 3795720 |
Statements
Activity selection games and the minimum‐cut problem (English)
0 references
1983
0 references
activity selection games
0 references
minimum-cut problem
0 references
capacitated network
0 references
selection problem
0 references
cooperative game
0 references
optimal selection
0 references
convex game
0 references
core
0 references
Shapley value
0 references
