Matroid intersections, polymatroid inequalities, and related problems

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

Volumn 2420, Issue , 2002, Pages 143-154

  Boros, Endre ^a   Elbassioni, Khaled ^b   Gurvich, Vladimir ^a   Khachiyan, Leonid ^b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS;

COMMON GROUND; FEASIBLE SOLUTION; MATROID INTERSECTION; MAXIMAL SETS; POLYMATROIDS; QUASI-POLYNOMIAL TIME; RIGHT-HAND SIDES;

POLYNOMIAL APPROXIMATION;

EID: 84957037513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45687-2_11     Document Type: Conference Paper

References (19)

1. R. Agrawal, T. Imielinski and A. Swami, Mining associations between sets of items in massive databases, Proc. 1993 ACM-SIGMOD Int. Conf. on Management of Data, pp. 207-216.
2. R. Agrawal, H. Mannila, R. Srikant, H. Toivonen and A. I. Verkamo, Fast discovery of association rules, in U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth and R. Uthurusamy eds., Advances in Knowledge Discoveryand Data Mining, pp. 307-328, AAAI Press, Menlo Park, California, 1996.
3. J. C. Bioch and T. Ibaraki, Complexity of identification and dualization of positive Boolean functions, Information and Computation 123 (1995) pp. 50-63.
4. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan and K. Makino, On generating all minimal integer solutions for a monotone system of linear inequalities, in ICALP 2001, LNCS 2076, pp. 92-103. An extended version is to appear in SIAM Journal on Computing.
5. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan, An inequality for polymatroid functions and its applications, DIMACS Technical Report 2001-14, Rutgers University, http://dimacs.rutgers.edu/TechnicalReports/2001.html.
6. E. Boros, V. Gurvich, L. Khachiyan and K. Makino, Dual bounded generating problems: partial and multiple transversals of a hypergraph. SIAM Journal on Computing 30 (6) (2001) pp. 2036-2050.
7. E. Boros, V. Gurvich, L. Khachiyan and K. Makino, On the complexity of generating maximal frequent and minimal infrequent sets, in STACS 2002, LNCS 2285, pp. 133-141.
8. C. J. Colbourn, The combinatorics of network reliability, Oxford Univ. Press, 1987.
9. M. L. Fredman and L. Khachiyan, On the complexity of dualization of monotone disjunctive normal forms, Journal of Algorithms, 21 (1996) pp. 618-628.
10. M. Galań, I. Garciá-Vargas, F.V. Fernańdez and A. Rodriģuez-Vaźquez, A new matroid intersection algorithm for symbolic large circuit analysis, in Proc. 4th Int. Workshop on Symbolic Methods and Applications to Circuit Design, Oct. 1996.
11. V. Gurvich and L. Khachiyan, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Applied Mathematics, 96-97 (1999) pp. 363-373.
12. T. Helgason, Aspects of the theory of hypermatroids, in Hypergraph Seminar, Lecture Notes in Math. 411 (1975) Springer, pp. 191-214.
13. E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976.
14. E. Lawler, J. K. Lenstra and A. H. G. Rinnooy Kan, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM Journal on Computing, 9 (1980) pp. 558-565.
15. K. Makino and T. Ibaraki, Interior and exterior functions of Boolean functions, Discrete Applied Mathematics, 69 (1996) pp. 209-231.
16. K. G. Ramamurthy, Coherent Structures and Simple Games, Kluwer Academic Publishers, 1990.
17. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, 5 (1975) pp. 237-252.
18. R. H. Sloan, K. Takata and G. Turan, On frequent sets of Boolean matrices, Annals of Mathematics and Artificial Intelligence 24 (1998) pp. 1-4.
19. D.J.A. Welsh, Matroid Theory (Academic Press, London, New York, San Francisco 1976).