Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem.
Walter DidimoFedor V. FominPetr A. GolovachTanmay InamdarStephen G. KobourovMarie Diana SieperPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- set cover
- primal dual
- integrality gap
- approximation ratio
- np hardness
- exact algorithms
- randomized algorithms
- precedence constraints
- lower bound
- optimal solution
- open shop
- network design problem
- undirected graph
- graph mining
- constant factor
- upper bound
- approximation schemes
- scheduling problem
- greedy heuristic
- combinatorial auctions
- integer programming