Polyhedral structure of submodular and posi-modular systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1533 LNCS, Issue , 1998, Pages 169-178

  Nagamochi, Hiroshi ^a   Ibaraki, Toshihide ^a  

^a KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

EDGE CONNECTIVITY AUGMENTATION PROBLEMS; FINITE SET; LAMINAR FAMILIES; MODULAR SYSTEM; POLYHEDRAL STRUCTURES; POLYNOMIAL-TIME; SET FUNCTION; SUBMODULAR;

SET THEORY;

EID: 84867616981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49381-6_19     Document Type: Conference Paper

References (8)

1. G.-R. Cai and Y.-G. Sun, The minimum augmentation of any graph to k-edge-conn ected graph, Networks, 19, 1989, 151-172.
2. J. Edmonds, Submodular functions, matroids, and certain polyhedra, Proc. Calgary Int. Conference on Combinatorial Structures and Their Applications (R. Guy, H. Hanani, N. Sauer and J. Schönheim, eds., Gordon and Breach, New York), 1970, 69-87.
3. A. Frank, Augmenting graphs to meet edge-connectivity requirements, SIAM J. Discrete Mathematics, 5, 1992, 25-53.
4. A. Frank, Applications of submodular functions, in Surveys in Combinatorics, Keith Walker, ed., London Math. Soc. Lecture Notes Ser. 187, 1993, 85-136.
5. T. Ibaraki and N. Katoh, Resource Allocation Problems - Algorithmic Approaches, Foundations of Computing Series, MIT Press, 1988.
6. H. Nagamochi and T. Ibaraki, A note on minimizing submodular functions, Information Processing Letters (to appear).
7. L. S. Shapley, A value for n-person games, H. W. Kuhn and A. W. Tucker (eds), Contributions to the Theory of Games, II, Annals of Mathematics Studies, 28, 1953, 307-317.
8. L. S. Shapley, Cores of convex games, Int. J. of Game Theory, 1, 1971, 11-26.