Complexity and Approximability of Parameterized MAX-CSPs

Holger Dell, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Tobias Mömke. Complexity and Approximability of Parameterized MAX-CSPs. Algorithmica, 79(1):230-250, 2017. [doi]

@article{DellKLMM17,
  title = {Complexity and Approximability of Parameterized MAX-CSPs},
  author = {Holger Dell and Eun Jung Kim 0002 and Michael Lampis and Valia Mitsou and Tobias Mömke},
  year = {2017},
  doi = {10.1007/s00453-017-0310-8},
  url = {https://doi.org/10.1007/s00453-017-0310-8},
  researchr = {https://researchr.org/publication/DellKLMM17},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {79},
  number = {1},
  pages = {230-250},
}