|
1 |
An efficient characterization of submodular spanning tree games Enthalten in Mathematical programming 25.4.2020: 1-19
|
|
|
2 |
Spanning-Tree Games Hefetz, Dan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2018
|
|
|
3 |
On the complexity of testing membership in the core of min-cost spanning tree games Enthalten in International journal of game theory Bd. 26, Nr. 3, date:10.1997: 361-366
|
|
|
4 |
On the core and nucleolus of minimum cost spanning tree games Enthalten in Mathematical programming Bd. 29, Nr. 3, date:7.1984: 323-347
|
|
|
5 |
Minimum cost spanning tree games Enthalten in Mathematical programming Bd. 21, Nr. 1, date:12.1981: 1-18
|
|
|
6 |
Generalized minimum spanning tree games Enthalten in EURO journal on computational optimization Bd. 4, 1.8.2015, Nr. 2, date:5.2016: 167-188
|
|