Abstract
This paper presents a generic scheme for fractional packing in ideal clutters. Consider an ideal clutter with a nonnegative capacity function on its vertices. It follows from ideality that for any nonnegative capacity the total multiplicity of an optimal fractional packing is equal to the minimum capacity of a vertex cover. Our scheme finds an optimal packing using at most n edges with positive multiplicities, performing minimization for the clutter at most n times and minimization for its blocker at most n 2 times, where n denotes the cardinality of the vertex set. Applied to the clutter of dijoins (directed cut covers), the scheme provides the first combinatorial polynomial-time algorithm for fractional packing of dijoins.
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 callDisclaimer: 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.
