Pages that link to "Item:Q999732"
From MaRDI portal
The following pages link to Additivity in minimum cost spanning tree problems (Q999732):
Displayed 25 items.
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems (Q404757) (← links)
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems (Q417711) (← links)
- Linking the Kar and folk solutions through a problem separation property (Q480847) (← links)
- A characterization of kruskal sharing rules for minimum cost spanning tree problems (Q532655) (← links)
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations (Q845585) (← links)
- Characterization of monotonic rules in minimum cost spanning tree problems (Q891331) (← links)
- Minimum cost spanning tree problems with groups (Q964464) (← links)
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems (Q964827) (← links)
- On obligation rules for minimum cost spanning tree problems (Q980946) (← links)
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms (Q1038341) (← links)
- Minimum incoming cost rules for arborescences (Q1697835) (← links)
- Truth-telling and Nash equilibria in minimum cost spanning tree models (Q1926969) (← links)
- Cost additive rules in minimum cost spanning tree problems with multiple sources (Q2241238) (← links)
- A generalization of obligation rules for minimum cost spanning tree problems (Q2275607) (← links)
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems (Q2275934) (← links)
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources (Q2334863) (← links)
- An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← links)
- A monotonic and merge-proof rule in minimum cost spanning tree situations (Q2358794) (← links)
- A new rule for source connection problems (Q2514781) (← links)
- Minimum cost spanning tree problems as value sharing problems (Q2689423) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS (Q2854002) (← links)
- The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources (Q5072241) (← links)
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups (Q6110599) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)