Improved approximations for k-Exchange systems (Extended Abstract)

Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward

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

Abstract

Submodular maximization and set systems play a major role in combinatorial optimization. It is long known that the greedy algorithm provides a 1/(k+1)-approximation for maximizing a monotone submodular function over a k-system. For the special case of k-matroid intersection, a local search approach was recently shown to provide an improved approximation of 1 / (k+δ) for arbitrary δ≥0. Unfortunately, many fundamental optimization problems are represented by a k-system which is not a k-intersection. An interesting question is whether the local search approach can be extended to include such problems. We answer this question affirmatively. Motivated by the b-matching and k-set packing problems, as well as the more general matroid k-parity problem, we introduce a new class of set systems called k-exchange systems, that includes k-set packing, b-matching, matroid k-parity in strongly base orderable matroids, and additional combinatorial optimization problems such as: independent set in (k+1)-claw free graphs, asymmetric TSP, job interval selection with identical lengths and frequency allocation on lines. We give a natural local search algorithm which improves upon the current greedy approximation, for this new class of independence systems. Unlike known local search algorithms for similar problems, we use counting arguments to bound the performance of our algorithm. Moreover, we consider additional objective functions and provide improved approximations for them as well. In the case of linear objective functions, we give a non-oblivious local search algorithm, that improves upon existing local search approaches for matroid k-parity.

Original languageEnglish
Title of host publicationAlgorithms, ESA 2011 - 19th Annual European Symposium, Proceedings
Pages784-798
Number of pages15
DOIs
StatePublished - 2011
Externally publishedYes
Event19th Annual European Symposium on Algorithms, ESA 2011 - Saarbrucken, Germany
Duration: 5 Sep 20119 Sep 2011

Publication series

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

Conference

Conference19th Annual European Symposium on Algorithms, ESA 2011
Country/TerritoryGermany
CitySaarbrucken
Period5/09/119/09/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Improved approximations for k-Exchange systems (Extended Abstract)'. Together they form a unique fingerprint.

Cite this