Additivity in minimum cost spanning tree problems
From MaRDI portal
(Redirected from Publication:999732)
Recommendations
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- Additive Tree Spanners
- scientific article; zbMATH DE number 540118
- Sequential contributions rules for minimum cost spanning tree problems
- The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
- Characterizing rules in minimum cost spanning tree problems
- On the simultaneous minimum spanning trees problem
- Approximating minimum-cost graph problems with spanning tree edges
- A generalization of the minimum branch vertices spanning tree problem
Cites work
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A fair rule in minimum cost spanning tree problems
- A non-cooperative approach to the cost spanning tree problem.
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cost monotonicity, consistency and minimum cost spanning tree games
- Minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
- Spanning network games.
- The P-value for cost sharing in minimum
- The optimistic TU game in minimum cost spanning tree problems
Cited in
(30)- The folk rule for minimum cost spanning tree problems with multiple sources
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- Linking the Kar and folk solutions through a problem separation property
- Merge-proofness in minimum cost spanning tree problems
- Stable and weakly additive cost sharing in shortest path problems
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
- Cost sharing in networks: some open questions
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- An FPT Algorithm for Minimum Additive Spanner Problem.
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- scientific article; zbMATH DE number 540118 (Why is no real title available?)
- Minimum cost spanning tree problems with groups
- Characterizing rules in minimum cost spanning tree problems
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- On obligation rules for minimum cost spanning tree problems
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Characterization of monotonic rules in minimum cost spanning tree problems
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- An axiomatic approach in minimum cost spanning tree problems with groups
- A generalization of obligation rules for minimum cost spanning tree problems
- Minimum incoming cost rules for arborescences
- A new rule for source connection problems
- Minimum cost spanning tree problems as value sharing problems
This page was built for publication: Additivity in minimum cost spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999732)
