Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Structure in Approximation Classes
SIAM Journal on Computing
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
| Hi-index | 0.00 |
The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. Also the corresponding approximation problem is shown NP-hard for certain approximation performance bounds. This is in contrast with the maximum matroid-matroid intersection which is solvable in polynomial time by an old result of Edmonds.