1. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness and satisfiability of bounded occurrence instances of SAT. Technical Report TR03-022, ECCC (2003)
2. Bird, C.G.: On cost allocation for a spanning tree: a game theoretic approach. Networks 6, 335–350 (1976)
3. Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24, 751–766 (1999)
4. Edmonds, J., Johnson, L.: Matching: a well-solved class of integer linear programs. In: Proceedings of Calgary International Conference on Combinatorial Structures and their Applications, pp. 89–92. Gordon and Breach, New York (1970)
5. Faigle, U., Kern, W.: On the core of ordered submodular cost games. Math. Program. 87, 483–499 (2000)