Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products.
Miroslaw KowalukAndrzej LingasPublished in: CALDAM (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- open shop
- minimum cost
- network design problem
- facility location problem
- primal dual
- integrality gap
- constant factor
- approximation ratio
- np hardness
- set cover
- search space
- approximation schemes
- disjoint paths
- undirected graph
- boolean functions
- simulated annealing
- constant factor approximation