Login / Signup

Grouped domination parameterized by vertex cover, twin cover, and beyond.

Tesshu HanakaHirotaka OnoYota OtachiSaeki Uda
Published in: Theor. Comput. Sci. (2024)
Keyphrases
  • vertex cover
  • approximation algorithms
  • planar graphs
  • partial order
  • precedence constraints
  • optimality criterion
  • np hard
  • polynomial time approximation
  • reinforcement learning
  • special case
  • worst case
  • shortest path