License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2012.42
URN: urn:nbn:de:0030-drops-34315
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3431/

Ward, Justin

A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems

pdf-format:
Dokument 1.pdf (562 KB)


Abstract

We consider the monotone submodular k-set packing problem in the context of the more general problem of maximizing a monotone submodular function in a k-exchange system. These systems, introduced by Feldman et al. [Feldman,2011], generalize the matroid k-parity problem in a wide class of matroids and capture many other combinatorial optimization problems. We give a deterministic, non-oblivious local search algorithm that attains an approximation ratio of (k + 3)/2 + epsilon for the problem of maximizing a monotone submodular function in a k-exchange system, improving on the best known result of k+epsilon, and answering an open question posed by Feldman et al.

BibTeX - Entry

@InProceedings{ward:LIPIcs:2012:3431,
  author =	{Justin Ward},
  title =	{{A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{42--53},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{Christoph D{\"u}rr and Thomas Wilke},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3431},
  URN =		{urn:nbn:de:0030-drops-34315},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.STACS.2012.42},
  annote =	{Keywords: k-set packing, k-exchange systems, submodular maximization, local search, approximation algorithms}
}

Keywords: k-set packing, k-exchange systems, submodular maximization, local search, approximation algorithms
Seminar: 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Issue date: 2012
Date of publication: 24.02.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI