Cost allocation for steiner trees
From MaRDI portal
Publication:4159214
DOI10.1002/net.3230080104zbMath0378.90118MaRDI QIDQ4159214
Publication date: 1978
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230080104
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
91A40: Other game-theoretic models
90B99: Operations research and management science
Related Items
Connection problems in mountains and monotonic allocation schemes., Axiomatization of the Shapley value on minimum cost spanning tree games, On the core of network synthesis games, Sharing the cost of multicast transmissions in wireless networks, On the core of a traveling salesman cost allocation game, Supportability of network cost functions, Cost allocation in the Chinese postman problem, Minimum cost forest games, Minimum cost spanning tree games and population monotonic allocation schemes., Total balancedness condition for Steiner tree games., Traveling salesman games with the Monge property, Steiner minimal trees on regular polygons with centre, A survey on networking games in telecommunications, Minimal Subsidies in Expense Sharing Games, On the core and nucleolus of minimum cost spanning tree games, Cooperative networks games with elastic demands, Minimum cost spanning tree games
Cites Work
