Abstract

In a partial inverse matroid problem, given a matroid M=(S,I), a real valued weight function w on S, and an independent set I0∈I, the goal is to modify the weight w as small as possible to a new weight w¯ such that there exists a w¯-maximum base containing I0. In this paper, we study a constraint version of the partial inverse matroid problem in which the weight can only be decreased. A polynomial time algorithm is presented under l∞-norm.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.