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

Taneli Mielikäinen; Esko Ukkonen

doi:10.1016/j.dam.2005.05.018

ScienceGate Book Chapters

JOURNAL ARTICLE

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

Taneli Mielikäinen Esko Ukkonen

Year: 2005 Journal: Discrete Applied Mathematics Vol: 154 (4)Pages: 684-691 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2005.05.018

Get Full-Text PDF Get Analytical Report

Keywords:

Matroid Mathematics Combinatorics Parameterized complexity Weighted matroid Maximization Intersection (aeronautics) Matroid partitioning Discrete mathematics Time complexity Oriented matroid Satisfiability Graphic matroid Mathematical optimization

Metrics

Cited By

0.70

FWCI (Field Weighted Citation Impact)

Refs

0.71

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Computational Geometry and Mesh Generation

Physical Sciences → Computer Science → Computer Graphics and Computer-Aided Design

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

Metrics

Citation History

Topics

Related Documents

The Complexity of Maximum Matroid-Greedoid Intersection

The complexity of the matroid–greedoid partition problem

Neutrosophic Matroid, Antimatroid, and Greedoid

The Bhargava Greedoid as a Gaussian Elimination Greedoid

Greedoid polyhedra