Persistency and matroid intersection

Persistency and matroid intersection

0.00 Avg rating0 Votes
Article ID: iaor200971051
Country: Germany
Volume: 6
Issue: 4
Start Page Number: 435
End Page Number: 445
Publication Date: Oct 2009
Journal: Computational Management Science
Authors: , ,
Abstract:

In this paper, we show that for any independence system, the problem of finding a persistency partition of the ground set and that of finding a maximum weight independent set are polynomially equivalent.

Reviews

Required fields are marked *. Your email address will not be published.