@inproceedings{deb7f53854314aa9872374c0e49e787a,

title = "The minimum feasible tileset problem",

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.",

author = "Yann Disser and Stefan Kratsch and Manuel Sorge",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2015.; 12th International Workshop on Approximation and Online Algorithms, WAOA 2014 ; Conference date: 11-09-2014 Through 12-09-2014",

year = "2015",

month = jan,

day = "1",

doi = "10.1007/978-3-319-18263-6_13",

language = "English",

isbn = "9783319182629",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "144--155",

editor = "Ola Svensson and Evripidis Bampis",

booktitle = "Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Revised Selected Papers",

address = "Germany",

}