Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Is the shortest circuit/cocircuit problem on transversal matroids or gammoids NP-hard? Is there anything known about this? It is known that the shortest circuit on binary matroid is NP-hard. But I can not find any reference on transversal matroids or gammoids.

This is a followup question of A minimum set hitting every base of a matroid

share|improve this question
add comment

1 Answer

The shortest circuit problem for Transversal matroids is NP-hard, by a reduction from Clique. See Theorem 2.1 in "Reliable Assignments of Processors to Tasks and Factoring on Matroids" by Charles J. Colbourn and Ehab S. Elmallah ( http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.6967 ).

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.