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