Author:
Darmann Andreas,Pferschy Ulrich,Schauer Joachim
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)
2. Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335–350 (1976)
3. Lecture Notes in Computer Science;H.L. Bodlaender,1993
4. Bogomolnaia, A., Moulin, H.: Sharing the cost of a minimal cost spanning tree: beyond the folk solution. Rice University, Mimeo (2008)
5. Darmann, A., Klamler, C., Pferschy, U.: Maximizing the minimum voter satisfaction on spanning trees. Mathematical Social Sciences 58, 238–250 (2009)
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献