Abstract
Given a collection of sets of cardinality at most k, with weights for each set, the maximum weighted packing problem is that of finding a collection of disjoint sets of maximum total weight. We study the worst case behavior of the t-local search heuristic for this problem proving a tight bound of k - 1 + 1/t. This continues the work of Hurkens and Schrijver for unweighted packing problems.
Cite
CITATION STYLE
Arkin, E. M., & Hassin, R. (1997). On local search for weighted k-set packing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1284, pp. 13–22). Springer Verlag. https://doi.org/10.1007/3-540-63397-9_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
