A note on Steiner tree games

DOI10.1002/net.20436zbMath1241.90024OpenAlexW2039574518MaRDI QIDQ2892158

Jadranka Skorin-Kapov, Darko Skorin-Kapov

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20436

zbMATH Keywords

cooperative gamesmathematical programmingcost allocationcommunication networkSteiner trees

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43)

Related Items (2)

Social enterprise tree network games ⋮ On the core and nucleolus of directed acyclic graph games

Cites Work

• Unnamed Item
• Unnamed Item
• On the core of network synthesis games
• Traveling salesman games
• On a cost allocation problem arising from a capacitated concentrator covering problem
• On tabu search for the location of interacting hub facilities
• On the complexity of testing membership in the core of min-cost spanning tree games
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Recent results on approximating the Steiner tree problem and its generalizations
• Threshold based discounting networks: the cost allocation provided by the nucleolus
• On the core of the minimum cost Steiner tree game in networks
• On the core and nucleolus of minimum cost spanning tree games
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• On Some Network Flow Games
• On cost allocation for a spanning tree: A game theoretic approach
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Hub network games
• Packing rooted directed cuts in a weighted directed graph
• Applications of approximation algorithms to cooperative games

This page was built for publication: A note on Steiner tree games