Name
Abstract | ||
|---|---|---|
In this paper we consider the covering problem on a network G = (V, E) with edge demands. The task is to cover a subset J subset of E of the edges with a minimum number of facilities within a predefined coverage radius. We focus on both the nodal and the absolute version of this problem. In the latter, facilities may be placed everywhere in the network. While there already exist polynomial time algorithms to solve the problem on trees, we establish a finite dominating set (i.e., a finite subset of points provably containing an optimal solution) for the absolute version in general graphs. Complexity and approximability results are given and a greedy strategy is proved to be a (1 + ln(|J|))-approximate algorithm. Finally, the different approaches are compared in a computational study. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/net.21924 | NETWORKS |
Keywords | DocType | Volume |
approximability,computational study,edge cover,finite dominating set,network location,NP-hardness | Journal | 75.0 |
Issue | ISSN | Citations |
3.0 | 0028-3045 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicolas Fröhlich | 1 | 0 | 0.34 |
| Andrea Maier | 2 | 0 | 1.35 |
| Horst W. Hamacher | 3 | 562 | 57.39 |