An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643): Difference between revisions

Summary: Let \(G = (V, E)\) be a simple connected undirected graph. Each vertex \(v \in V\) has a cost \(c(v)\) and provides a positive coverage radius \(R(v)\). A distance \(d_{uv}\) is associated with each edge \(\{u, v\} \in E\), and \(d(u, v)\) is the shortest distance between every pair of vertices \(u, v \in V\). A vertex \(v\) can cover all vertices that lie within the distance \(R(v)\), except the vertex itself. The conditional covering problem is to minimize the sum of the costs required to cover all the vertices in \(G\). This problem is NP-complete for general graphs, even it remains NP-complete for chordal graphs. In this paper, an \(O(n^2)\) time algorithm to solve a special case of the problem in a trapezoid graph is proposed, where \(n\) is the number of vertices of the graph. In this special case, \(d_{uv} = 1\) for every edge \(\{u, v\} \in E, c(v) = c\) for every \(v \in V(G)\), and \(R(v) = R\), an integer >1, for every \(v \in V(G)\). A new data structure on trapezoid graphs is used to solve the problem.