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 … Show more
“…Ressaltamos que este algoritmo foi estendido por Barahona [Bar04] para o problema do empacotamento fracionário de T -junções e, por Matsuoka [Mat12], para o problema do empacotamento fracionário em clutters ideais.…”
“…Ressaltamos que este algoritmo foi estendido por Barahona [Bar04] para o problema do empacotamento fracionário de T -junções e, por Matsuoka [Mat12], para o problema do empacotamento fracionário em clutters ideais.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.