The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization

Discrete Applied Mathematics

Volumn 154, Issue 4, 2006, Pages 684-691

  Mielikäinen, Taneli ^a   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

Combinatorial optimization; Fixed parameter intractability; Inapproximability; NP hardness

Indexed keywords

APPROXIMATION THEORY; BOOLEAN ALGEBRA; OPTIMIZATION; POLYNOMIALS;

COMBINATORIAL OPTIMIZATION; FIXED-PARAMETER INTRACTABILITY; INAPPROXIMABILITY; NP-HARDNESS;

PROBLEM SOLVING;

EID: 32544453413     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.05.018     Document Type: Conference Paper

References (8)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties 1999 Springer Berlin
2. P. Crescenzi, V. Kann, R. Silvestri, and L. Trevisan Structure in approximation classes SIAM J. Comput. 28 1999 1759 1782
3. R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness I: basic results SIAM J. Comput. 24 1995 873 921
4. R.G. Downey, and M.R. Fellows Parameterized Complexity 1999 Springer Berlin
5. J. Edmonds Minimum partition of a matroid into independent subsets J. Res. Nat. Bur. Standards 69B 1965 67 72
6. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company New York
7. B. Korte, and J. Vygen Combinatorial Optimization: Theory and Algorithms 2000 Springer Berlin
8. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1998 Dover Publications New York