1![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 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](https://www.pdfsearch.io/img/033d91402573622e3b362b16c97959e6.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2008-11-17 17:17:16
|
---|
2![](https://www.pdfsearch.io/img/902592b9c3097371735a9101d609337f.jpg) | Add to Reading ListSource URL: www-cc.cs.uni-saarland.deLanguage: English - Date: 2014-08-05 05:09:25
|
---|
3![Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I](https://www.pdfsearch.io/img/2f99de3e70878ba162a53517ddaf93db.jpg) | Add to Reading ListSource URL: www.tmrfindia.orgLanguage: English - Date: 2008-11-10 09:49:21
|
---|
4![A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S
ien
es University of Texas at Austin A Class of Greedy Algorithms And Its Relation to Greedoids Srinivas Nedunuri Dept. of Computer S
ien
es University of Texas at Austin](https://www.pdfsearch.io/img/97b0aaa8448503e71f9fc0313048bc54.jpg) | Add to Reading ListSource URL: www.kestrel.eduLanguage: English - Date: 2014-10-03 20:56:47
|
---|
5![Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences, Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids? Petr Hlinˇ en´ y School of Mathematical and Computing Sciences,](https://www.pdfsearch.io/img/35de3957211c3355b19f44fada913483.jpg) | Add to Reading ListSource URL: www.fi.muni.czLanguage: English - Date: 2005-07-07 11:28:02
|
---|
6![Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep. Finding Branch-decompositions and Rank-decompositions Petr Hlinˇen´y ∗† Faculty of Informatics Masaryk University Botanick´a 68a, Brno, Czech Rep.](https://www.pdfsearch.io/img/892cbf9e0e725ebd7b82b5ad23ec9223.jpg) | Add to Reading ListSource URL: www.fi.muni.czLanguage: English - Date: 2008-02-12 04:44:10
|
---|
7![](https://www.pdfsearch.io/img/e54c84bc8fa0e8e53dbd0f9bb9cc8ad7.jpg) | Add to Reading ListSource URL: web.engr.illinois.eduLanguage: English - Date: 2014-12-28 09:02:30
|
---|
8![](https://www.pdfsearch.io/img/149eb54bef1a27a0b50acd5f5b9ccd02.jpg) | Add to Reading ListSource URL: web.engr.illinois.eduLanguage: English - Date: 2014-12-28 09:03:13
|
---|
9![Complexity of Testing Reachability in Matroids Complexity of Testing Reachability in Matroids](https://www.pdfsearch.io/img/0ca6a8a27c3f41384264f5b3a5507529.jpg) | Add to Reading ListSource URL: cjtcs.cs.uchicago.eduLanguage: English - Date: 2014-07-14 14:10:19
|
---|
10![Massachusetts Institute of Technology: Combinatorial Optimization Michel X. Goemans Handout 9 March 20th, 2009 Massachusetts Institute of Technology: Combinatorial Optimization Michel X. Goemans Handout 9 March 20th, 2009](https://www.pdfsearch.io/img/4ff72dbf4fff45bbf748296128d045b2.jpg) | Add to Reading ListSource URL: www-math.mit.eduLanguage: English - Date: 2009-03-26 11:24:24
|
---|