An efficient algorithm to solve the conditional covering problem on trapezoid graphs (Q410643): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C85 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C12 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05B40 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021215 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
data structure on trapezoid graphs | |||
Property / zbMATH Keywords: data structure on trapezoid graphs / rank | |||
Normal rank |
Revision as of 19:28, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An efficient algorithm to solve the conditional covering problem on trapezoid graphs |
scientific article |
Statements
An efficient algorithm to solve the conditional covering problem on trapezoid graphs (English)
0 references
3 April 2012
0 references
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.
0 references
data structure on trapezoid graphs
0 references