Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FCT
2001
Springer

favoriteEmaildiscussreport

109views Applied Computing» more FCT 2001»

The Complexity of Maximum Matroid-Greedoid Intersection

13 years 9 months ago

The Complexity of Maximum Matroid-Greedoid Intersection

Download www.cs.helsinki.fi

Abstract. The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP-hard by expressing the satisﬁability 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.

Taneli Mielikäinen, Esko Ukkonen

Real-time Traffic

Applied Computing | Corresponding Approximation Problem | FCT 2001 | Maximum Intersection Problem | Maximum Matroid-matroid Intersection |

claim paper

Related Content

» The complexity of maximum matroidgreedoid intersection and weighted greedoid maximization

» An Architecture for Hierarchical Collision Detection

» Matroid Representation of Clique Complexes

» Better bounds on the union complexity of locally fat objects

» Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions

» On Multiple Symbol Detection for Diagonal DUSTM Over Ricean Channels

» Covering Points by Isothetic Unit Squares

» Reduced Complexity ML Detection for Differential Unitary SpaceTime Modulation with Carrier...

» Minimizing the stabbing number of matchings trees and triangulations

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	FCT
Authors	Taneli Mielikäinen, Esko Ukkonen

Comments (0)