Timeline for A minimum set hitting every base of a matroid
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2016 at 14:28 | history | edited | Tony Huynh | CC BY-SA 3.0 |
added 134 characters in body
|
| May 24, 2012 at 2:06 | comment | added | Tony Huynh | Hmmm...I'm not sure about transversal matroids or Gammoids, but my guess is that it's still hard. Probably you should post this as a separate question so that it is more visible to others. It's also good etiquette to link questions that are posted at multiple sites. Cheers. | |
| May 23, 2012 at 1:29 | comment | added | lapordge | I have an additional question: Is there anything known about the complexity of computing the shorest circuit/cocircuit problem on transversal matroids or Gammoids? Thanks. (BTW: should I make this a Quesion instead of a comment?) | |
| May 22, 2012 at 0:23 | vote | accept | lapordge | ||
| May 21, 2012 at 2:39 | history | edited | Tony Huynh | CC BY-SA 3.0 |
deleted 11 characters in body; added 8 characters in body
|
| May 21, 2012 at 2:33 | history | answered | Tony Huynh | CC BY-SA 3.0 |