Greedoid

Results: 31



#Item
1The 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

Add to Reading List

Source URL: users.cms.caltech.edu

Language: English - Date: 2008-11-17 17:17:16
2

PDF Document

Add to Reading List

Source URL: www-cc.cs.uni-saarland.de

Language: English - Date: 2014-08-05 05:09:25
3Sutra: 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

Add to Reading List

Source URL: www.tmrfindia.org

Language: English - Date: 2008-11-10 09:49:21
4A 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

Add to Reading List

Source URL: www.kestrel.edu

Language: English - Date: 2014-10-03 20:56:47
5Branch-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,

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2005-07-07 11:28:02
6Finding 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.

Add to Reading List

Source URL: www.fi.muni.cz

Language: English - Date: 2008-02-12 04:44:10
7

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:30
8

PDF Document

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:03:13
9Complexity of Testing Reachability in Matroids

Complexity of Testing Reachability in Matroids

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2014-07-14 14:10:19
10Massachusetts 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

Add to Reading List

Source URL: www-math.mit.edu

Language: English - Date: 2009-03-26 11:24:24