<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-08-05 05:09:25Mathematics Combinatorial optimization Greedoid Order theory Matroid Submodular set function KnuthBendix completion algorithm |
| 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 approximateDocID: 1qkDx - View Document |
| PDF DocumentDocID: 1qbUT - View Document |
| Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - IDocID: 1pG70 - View Document |
| A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S ien es University of Texas at AustinDocID: 1kbC4 - View Document |
| Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,DocID: 18WF4 - View Document |