Quantum and approximation algorithms for maximum witnesses of Boolean matrix products.
Miroslaw KowalukAndrzej LingasPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- facility location problem
- minimum cost
- network design problem
- constant factor
- primal dual
- set cover
- approximation ratio
- open shop
- approximation schemes
- randomized algorithms
- approximation guarantees
- boolean functions
- disjoint paths
- np hardness
- objective function
- undirected graph
- evolutionary algorithm