Sciweavers

2 search results - page 1 / 1
» The complexity of maximum matroid-greedoid intersection and ...
Sort
View
FCT
2001
Springer
13 years 8 months ago
The Complexity of Maximum Matroid-Greedoid Intersection
Abstract. 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...
Taneli Mielikäinen, Esko Ukkonen
DAM
2006
136views more  DAM 2006»
13 years 3 months ago
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization,
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
Taneli Mielikäinen, Esko Ukkonen