Submodular containment is hard, even for networks

Operations Research Letters

Volumn 19, Issue 2, 1996, Pages 95-99

  McCormick, S Thomas ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Complexity; Games; Networks; Submodularity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FUNCTIONS; GAME THEORY; POLYNOMIALS;

COMPLEXITY OF DECIDING; CUT CAPACITY FUNCTION; ELLIPSOID ALGORITHM; MIN COST NETWORKS; POLYHEDRA; POLYNOMIAL ALGORITHMS; SUBMODULAR CONTAINMENT;

OPERATIONS RESEARCH;

EID: 0030213086     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(96)00016-8     Document Type: Article

References (7)

1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows: Theory, Algorithms and Applications, Prentice-Hall, New York, NY, 1993.
2. F. Blanchini, F. Rinaldi and W. Ukovich, "A network design problem for a distribution system with uncertain demands", Research Report 27/93/RR, Dipartimento di Matematica ed Informatica, University of Udine, Italy, 1994; to appear in SIAM J. Optim.
3. W.H. Cunningham, "Minimum cuts, modular functions, and matroid polyhedra", Networks 15, 205-215 (1985).
4. S. Fujishige, Submodular Functions and Optimization, Annals of Discrete Mathematics, Vol. 47, North-Holland, Amsterdam, 1991.
5. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to the Theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
6. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
7. N. Tomizawa and S. Fujishige, "Theory of hyperspace (VIII) - on the structures of hypermatroids of network type", Papers of the Technical Group on Circuits and Systems, Institute of Electronics and Communication Engineers of Japan, CAS81-62, 1981 (in Japanese).