Matroid oracle

Results: 4



#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
2Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

Contributions on Secretary Problems, Independent Sets of Rectangles and Related Problems by José Antonio Soto Submitted to the Department of Mathematics

Add to Reading List

Source URL: www.dim.uchile.cl

Language: English - Date: 2013-08-08 17:44:26
3The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗  Alan L. Selman†

The Informational Content of Canonical Disjoint NP-Pairs Christian Glaßer ∗ Alan L. Selman†

Add to Reading List

Source URL: www.cse.buffalo.edu

Language: English - Date: 2007-08-15 14:41:53
4COMPLEXITY IN COOPERATIVE GAME THEORY  J. M. Bilbao1 , J. R. Fernández2 and J. J. López3 Matemática Aplicada II, Escuela Superior de Ingenieros Camino de los Descubrimientos s/n, 41092 Sevilla, Spain http://www.esi.us

COMPLEXITY IN COOPERATIVE GAME THEORY J. M. Bilbao1 , J. R. Fernández2 and J. J. López3 Matemática Aplicada II, Escuela Superior de Ingenieros Camino de los Descubrimientos s/n, 41092 Sevilla, Spain http://www.esi.us

Add to Reading List

Source URL: www.esi2.us.es

Language: English - Date: 2004-03-02 07:07:34