On the complexity of some enumeration problems for matroids

SIAM Journal on Discrete Mathematics

Volumn 19, Issue 4, 2005, Pages 966-984

  Khachiyan, L ^a   Boros, E ^b   Elbassioni, K ^c   Gurvich, V ^b   Makino, K ^d  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^d OSAKA UNIVERSITY   (Japan)

Author keywords

Base; Circuit; Enumeration; Flat; Hypergraph; Hyperplane; Incremental polynomial time; Matroid; Multiway cut; Steiner tree

Indexed keywords

ENUMERATION; HYPERGRAPHS; HYPERPLANE; INCREMENTAL POLYNOMIAL TIME; MULTIWAY CUT; STEINER TREES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

NUMBER THEORY;

EID: 33750478895     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480103428338     Document Type: Article

References (23)

1. R. BIXBY AND W. CUNNINGHAM, Matroid Optimization and Algorithms, in Handbook of Combinatorics, R. L. Graham, M. Grötschel, and L. Lovász, eds., North-Holland, Amsterdam, 1995, pp. 550-609.
2. E. BOROS, K. ELBASSIONI, V. GURVICH, AND L. KHACHIYAN, Matroid intersections, polymatroid inequalities, and related problems, in Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS, Warsaw, 2002, pp. 143-154.
3. E. BOROS, K. ELBASSIONI, V. GURVICH, AND L. KHACHIYAN, Generating dual-bounded hypergraphs, Optim. Methods Softw., 17 (2002), pp. 749-781.
4. E. BOROS, K. ELBASSIONI, V. GURVICH, AND L. KHACHIYAN, Extending the Balas-Yu inequality on the number of maximal independent sets of graphs to hypergraphs and lattice products with applications, Math. Program. Ser. B, 98 (2003), pp. 355-368.
5. H. CRAPO, Structural rigidity, Struct. Topol. 1 (1979), pp. 26-45.
6. C. DOMINGO, N. MISHRA, AND L. PITT, Efficient read-k monotone CNF/DNF dualization using a learning with membership queries approach, Machine Learning, 37 (1999), pp. 89-110.
7. J. EDMONDS, Submodular functions, matroids, and certain polyhedra, in Combinatorial Structures and Their Applications, R. Guy, H. Hanani, N. Sauer, and J. Shönheim, eds., Gordon and Breach, New York, 1970, pp. 69-87.
8. T. EITER AND G. GOTTLOB, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput., 24 (1995), pp. 1278-1304.
9. T. EITER, G. GOTTLOB, AND K. MAKINO, New results on monotone dualization and generating hypergraph transversals, in Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montréal, Quebec, Canada, 2002, pp. 14-22.
10. M. L. FREDMAN AND L. KHACHIYAN, On the complexity of dualization of monotone disjunctive normal forms, J. Algorithms, 21 (1996), pp. 618-628.
11. V. GURVICH AND L. KHACHIYAN, On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions, Discrete Appl. Math., 96-97 (1999), pp. 363-373.
12. T. HELGASON, Aspects of the theory of hypermatroids, in Hypergraph Seminar, Lecture Notes in Math. 411, C. Berge and D. K. Ray-Chaudhuri, eds., Springer, New York, 1975, pp. 191-214.
13. R. M. KARP, On the complexity of combinatorial problems, Networks, 5 (1975), pp. 45-68.
14. R. KARP, E. UPFAL, AND A. WIGDERSON, The complexity of parallel search, J. Comput. System Sci., 36 (1988), pp. 225-253.
15. E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN, Generating all maximal independent sets: NP-hardness and polynomial-time algorithms, SIAM J. Comput., 9 (1980), pp. 558-565.
16. A. LEHMAN, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math., 12 (1964), pp. 687-725.
17. L. LOVÁSZ, Submodular functions and convexity, in Mathematical Programming: The State of the Art, Bonn 1982, Springer, New York, 1983, pp. 235-257.
18. J. S. PROVAN AND D. R. SHIER, A paradigm for listing (s, t)-cuts in graphs, Algorithmica, 15 (1996), pp. 357-372.
19. R. C. READ AND R. E. TARJAN, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, 5 (1975), pp. 237-252.
20. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. XIII. The disjoint path problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
21. P. D. SEYMOUR, A note on hyperplane generation, J. Combin. Theory Ser. B, 61 (1994), pp. 88-91.
22. V. VAZIRANI, Approximation Algorithms, Springer, Berlin, 2001.
23. D. J. A. WELSH, Matroid Theory, Academic Press, London, New York, San Francisco, 1976.