Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization.
Mrinal KumarSounaka MishraN. Safina DeviSaket SaurabhPublished in: Theor. Comput. Sci. (2014)
Keyphrases
- approximation algorithms
- bipartite graph
- np hard
- vertex cover
- np hardness
- maximum matching
- randomized algorithms
- approximation schemes
- special case
- minimum cost
- network design problem
- search space
- connected components
- np complete
- worst case
- edge weights
- lower bound
- constraint satisfaction problems
- scheduling problem
- precedence constraints
- link prediction
- greedy algorithm
- combinatorial optimization
- complex networks