The minimum feasible tileset problem

Yann Disser, Stefan Kratsch, Manuel Sorge

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

1 Scopus citations

Abstract

We consider the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile. We show that this problem is NP-complete even if each scenario contains at most three symbols. Ourmain result is a 4/3-approximation algorithm for the general case. In addition, we show that the Minimum Feasible Tileset problem is fixed-parameter tractable both when parameterized with the number of scenarios and with the number of symbols.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers
EditorsOla Svensson, Evripidis Bampis
PublisherSpringer Verlag
Pages144-155
Number of pages12
ISBN (Print)9783319182629
DOIs
StatePublished - 1 Jan 2015
Externally publishedYes
Event12th International Workshop on Approximation and Online Algorithms, WAOA 2014 - Wroclaw, Poland
Duration: 11 Sep 201412 Sep 2014

Publication series

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

Conference

Conference12th International Workshop on Approximation and Online Algorithms, WAOA 2014
Country/TerritoryPoland
CityWroclaw
Period11/09/1412/09/14

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'The minimum feasible tileset problem'. Together they form a unique fingerprint.

Cite this