Naturally submodular digraphs and forbidden digraph configurations

Discrete Applied Mathematics

Volumn 100, Issue 1-2, 2000, Pages 67-84

  Granot, D ^a   Granot, F ^a   Zhu, W R ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Directed graphs; Forbidden digraphs configurations; Primary: 05C75; Secondary: 05C38; Steiner tour; Submodularity

Indexed keywords

EID: 0242327591     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00167-5     Document Type: Article

References (14)

1. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Elsevier Science Publishing Co., Inc., New York, 1976.
2. M. Queyranne Federgruen, Zheng Y.S. Simple power of two policies are close to optimal in a general class of production. / distribution systems with general joint setup costs Math. Oper. Res. 17:1992;951-963.
3. D. Granot, F. Granot, W.R. Zhu, Circular network games, Working paper, Faculty of Commerce and Business Administration, UBC, Vancouver, 1996.
4. D. Granot, H. Hamers, S. Tijs, On some balanced, totally balanced and submodular delivery games, Working paper, Department of Econometrics, Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands, 1997 (Math. Prog., forthcoming.).
5. Granot D., Maschler M., Owen G., Zhu W.R. The kernel. / nucleolus of a standard tree game Int. J. GT. 25:1996;219-244.
6. Herer Y. Submodularity and the traveling salesman problem. European J. Oper. Res. 114:1999;489-508.
7. Herer Y., Penn M. Naturally submodular graphs: A polynomially solvable class for the TSP. Proc. AMS. 123(3):1995;673-679.
8. Herer Y., Roundy R. Heuristics for a one warehouse multi-retailer distribution problem with performance bounds. Oper. Res. 45:1997;102-115.
9. Littlechild S.C., Thompson G.F. Aircraft landing fees: a game theory approach. The Bell J. Ec. 8:1977;186-204.
10. Maschler M., Peleg B., Shapley L.S. The kernel and bargaining set of convex games. Int. J. GT. 2:1972;73-93.
11. Megiddo N. Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. 3:1978;189-196.
12. Mitchell S.L. Linear time algorithms to recognize outerplanar and maximal outerplanar graphs. Inform. Process. Lett. 9:1979;229-232.
13. Shapley L.S. Cores of convex games. Int. J. GT. 1:1971;11-26.
14. Tarjan R. Depth-first search and linear graph algorithms. SIAM. J. Comput. 1:1972;146-160.