The complexity of maximum matroid-greedoid intersection

DOI10.1007/3-540-44669-9_60MaRDI QIDQ4782748zbMATH OpenFDO

Authors Taneli Mielikäinen, Esko Ukkonen

Publication date 2 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2138/21380535

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics in computer science (68R05)

Recommendations

• The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
• scientific article; zbMATH DE number 26304
• Two algorithms for weighted matroid intersection
• The complexity of the matroid-greedoid partition problem
• scientific article; zbMATH DE number 123444

Cited in

(4)

• The complexity of the matroid-greedoid partition problem
• Matroid representation of clique complexes
• The complexity of maximum matroid--greedoid intersection and weighted greedoid maximiza\-tion
• On the inapproximability of maximum intersection problems

This page was built for publication: The complexity of maximum matroid-greedoid intersection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4782748)