• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Approximating Highly Inapproximable Problems on Graphs of Bounded Twin-Width.

Pierre BergéÉdouard BonnetHugues DéprésRémi Watrigant
Published in: STACS (2023)
Keyphrases
  • optimization problems
  • solving problems
  • database
  • information retrieval
  • bayesian networks
  • object recognition
  • graph matching