Pages that link to "Item:Q1926641"
From MaRDI portal
The following pages link to Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641):
Displaying 5 items.
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems (Q417711) (← links)
- Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions (Q528547) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Efficient computation of the Shapley value for large-scale linear production games (Q2177801) (← links)
- An Algorithm for Finding a Representation of a Subtree Distance (Q2835681) (← links)
