Approximation Algorithms for Minimum Chain Vertex Deletion

Abstract

A bipartite graph G = (A ∪ B, E) is called a chain graph if there exists an ordering \(\rho=<\!v_1, v_2, \ldots v_n\!>\) of the vertices in A = {v 1,...,v n } such that N(v 1) ⊆ N(v 2) ... ⊆ N(v n ). Here N(v) denotes the set of neighbors of the vertex v in G. We call the vertex-deletion problem corresponding to the class of chain graphs as the Minimum Chain Vertex Deletion problem and the induced subgraph problem corresponding to chain graphs as the Maximum Induced Chain Subgraph problem. A weighted version of these problems is obtained by assigning positive weights on vertices and asking for a minimum weight deletion set to get into the class of chain graphs or asking for maximum weight induced chain subgraph. Using a rounding technique we show that the weighted version of Minimum Chain Vertex Deletion, has a factor 2 approximation algorithm on bipartite graphs. We also give a factor 3/2 approximation algorithm for a weighted version of Maximum Induced Chain Subgraph on bipartite graphs. We also show that both these problems are APX-complete.