Login / Signup

Optimizing Polynomial-Time Solutions to a Network Weighted Vertex Cover Game.

Jie ChenKaiyi LuoChangbing TangZhao ZhangXiang Li
Published in: IEEE CAA J. Autom. Sinica (2023)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • computational complexity
  • special case
  • polynomial time approximation
  • optimal solution
  • lower bound
  • search space
  • np hard
  • minimum cost