Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Paradigms for Parameterized Enumeration
CNRS, Aix-Marseille Université, France.
Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Germany.
Institut für Theoretische Informatik, Gottfried Wilhelm Leibniz Universität, Germany.
Department of Computer and Information Science, Linköping University, Sweden.
Show others and affiliations
2016 (English)In: Theory of Computing Systems, ISSN 1432-4350, E-ISSN 1433-0490Article in journal (Refereed) Epub ahead of print
Abstract [en]

The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First, we define formally different notions of efficient enumeration in the context of parameterized complexity: FPT-enumeration and delayFPT. Second, we show how different algorithmic paradigms can be used in order to get parameter-efficient enumeration algorithms in a number of examples. These paradigms use well-known principles from the design of parameterized decision as well as enumeration techniques, like for instance kernelization and self-reducibility. The concept of kernelization, in particular, leads to a characterization of fixed-parameter tractable enumeration problems. Furthermore, we study the parameterized complexity of enumerating all models of Boolean formulas having weight at least k, where k is the parameter, in the famous Schaefer’s framework. We consider propositional formulas that are conjunctions of constraints taken from a fixed finite set Γ. Given such a formula and an integer k, we are interested in enumerating all the models of the formula that have weight at least k. We obtain a dichotomy classification and prove that, according to the properties of the constraint language Γ, either one can enumerate all such models in delayFPT, or no such delayFPT enumeration algorithm exists under some complexity-theoretic assumptions.

Place, publisher, year, edition, pages
2016.
Keyword [en]
Parameterized complexity, Kernel, Enumeration, Parameterized enumeration, Algorithms, Self-reducibility
National Category
Computer and Information Science Discrete Mathematics
Identifiers
URN: urn:nbn:se:hj:diva-34361DOI: 10.1007/s00224-016-9702-4OAI: oai:DiVA.org:hj-34361DiVA: diva2:1057829
Note

A preliminary version of this paper appeared in the proceedings of MFCS 2013, LNCS 8087, pp. 290–301.

Available from: 2016-12-19 Created: 2016-12-19 Last updated: 2017-11-29

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Schmidt, Johannes

Search in DiVA

By author/editor
Schmidt, Johannes
In the same journal
Theory of Computing Systems
Computer and Information ScienceDiscrete Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 70 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf