A parameterized view on matroid optimization problems

Theoretical Computer Science

Volumn 410, Issue 44, 2009, Pages 4471-4479

  Marx, Dániel ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

Author keywords

Combinatorial optmization; Fixed parameter tractability; Matroids

Indexed keywords

BRUTE FORCE ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL OPTMIZATION; DISJOINT PATHS; FIXED-PARAMETER TRACTABILITY; INDEPENDENT SET; K TERMINALS; MATROID INTERSECTION; MATROID THEORY; MATROIDS; NP-HARD; OPTIMIZATION PROBLEMS; PARAMETERIZED; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME ALGORITHMS; RUNNING TIME;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL OPERATORS; MATRIX ALGEBRA;

SET THEORY;

EID: 70249124136     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.07.027     Document Type: Article

References (15)

1. Alon N., Yuster R., and Zwick U. Finding and counting given length cycles. Algorithmica 17 3 (1997) 209-223
2. Downey R.G., and Fellows M.R. Parameterized Complexity. Monographs in Computer Science (1999), Springer-Verlag, New York
3. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag, Berlin
4. In: Graham R.L., Grötschel M., and Lovász L. (Eds). Handbook of Combinatorics, Vol. 1, 2 (1995), Elsevier Science B.V., Amsterdam
5. Lovász L. Flats in matroids and geometric graphs. Combinatorial Surveys. Proc. Sixth British Combinatorial Conf., Royal Holloway Coll., Egham, 1977 (1977), Academic Press, London 45-86
6. Lovász L. Matroid matching and some applications. J. Combin. Theory Ser. B 28 2 (1980) 208-236
7. Mac Lane S., and Birkhoff G. Algebra. Third edition (1988), Chelsea Publishing Co., New York
8. Marx D. Parameterized coloring problems on chordal graphs. Theoret. Comput. Sci. 351 3 (2006) 407-424
9. Monien B. How to find long paths efficiently. Analysis and Design of Algorithms for Combinatorial Problems. Udine, 1982. North-Holland Math. Stud. vol. 109 (1985), North-Holland, Amsterdam 239-254
10. Perfect H. Applications of Menger's graph theorem. J. Math. Anal. Appl. 22 (1968) 96-111
11. Plehn J., and Voigt B. Finding minimally weighted subgraphs. Graph-Theoretic Concepts in Computer Science. Berlin, 1990. Lecture Notes in Comput. Sci. vol. 484 (1991), Springer, Berlin 18-29
12. Recski A. Matroid theory and its applications in electric network theory and statics. Algorithms and Combinatorics vol. 6 (1989), Springer-Verlag, Berlin, New York Akadémiai Kiadó, Budapest
13. Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. Assoc. Comput. Mach. 27 4 (1980) 701-717
14. Shoup V. Fast construction of irreducible polynomials over finite fields. J. Symbolic Comput. 17 5 (1994) 371-391
15. Zippel R. Probabilistic algorithms for sparse polynomials. Symbolic and Algebraic Computation. EUROSAM'79, Internat. Sympos., Marseille, 1979. Lecture Notes in Comput. Sci. vol. 72 (1979), Springer, Berlin 216-226