"Complexity and Approximability of Parameterized MAX-CSPs."

Holger Dell et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-017-0310-8

access: closed

type: Journal Article

metadata version: 2017-07-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/DellKLMM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/DellKLMM17
Holger Dell, Eun Jung Kim, Michael Lampis, Valia Mitsou, Tobias Mömke:
Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica 79(1): 230-250 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.