On local search for weighted k-set packing

Esther M. Arkin, Refael Hassin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAlgorithms - ESA 1997 - 5th Annual European Symposium, Proceedings
EditorsRainer Burkard, Gerhard Woeginger
PublisherSpringer Verlag
Pages13-22
Number of pages10
ISBN (Print)3540633979, 9783540633976
DOIs
StatePublished - 1997
Event5th Annual European Symposium on Algorithms, ESA 1997 - Graz, Austria
Duration: 15 Sep 199717 Sep 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1284
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th Annual European Symposium on Algorithms, ESA 1997
Country/TerritoryAustria
CityGraz
Period15/09/9717/09/97

Fingerprint

Dive into the research topics of 'On local search for weighted k-set packing'. Together they form a unique fingerprint.

Cite this