The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate

First Page		Document Content
Date: 2008-11-17 17:17:16 Mathematics Combinatorics Combinatorial optimization Matroid theory Discrete mathematics Matroid Greedoid Partition matroid Matroid oracle		The Complexity of the Matroid-Greedoid Partition Problem Vera Asodi∗ and Christopher Umans† Abstract We show that the maximum matroid-greedoid partition problem is NP-hard to approximate Add to Reading List Source URL: users.cms.caltech.edu Download Document from Source Website File Size: 192,32 KB Share Document on Facebook