Login / Signup

The Constant Inapproximability of the Parameterized Dominating Set Problem.

Yijia ChenBingkai Lin
Published in: FOCS (2016)
Keyphrases
  • dominating set
  • facility location problem
  • approximation algorithms
  • connected dominating set
  • facility location
  • np hard
  • special case
  • linear programming
  • high dimensional
  • evolutionary algorithm
  • scheduling problem