Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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
Document Date: 2008-11-17 17:17:16
Open Document
File Size: 192,32 KB
Share Result on Facebook
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