Skoči na glavni sadržaj

Izvorni znanstveni članak

https://doi.org/10.17535/crorr.2015.0007

Efficient parallel implementations of approximation algorithms for guarding 1.5D terrains

Goran Martinović orcid id orcid.org/0000-0002-7469-6018 ; Elektrotehnički fakultet, Sveučilište Josip Jurja Strossmayera u Osijeku, Osijek, Hrvatska
Domagoj Matijević ; Odjel za matematiku, Sveučilište Josipa Jurja Strossmayera u Osijeku, Osijek, Hrvatska
Domagoj  Ševerdija ; Odjel za matematiku, Sveučilište Josipa Jurja Strossmayera u Osijeku, Osijek, Hrvatska


Puni tekst: engleski pdf 158 Kb

str. 79-89

preuzimanja: 495

citiraj


Sažetak

In the 1.5D terrain guarding problem, an x-monotone polygonal line is dened by k vertices and a G set of terrain points, i.e. guards, and a N set of terrain points which guards are to observe (guard). This involves a weighted version of the guarding problem where guards G have weights. The goal is to determine a minimum weight subset of G to cover all the points in N, including a version where points from N have demands. Furthermore, another goal is to determine the smallest subset of G, such that every point in N is observed by the required number of guards. Both problems are NP-hard and have a factor 5 approximation [3, 4]. This paper will show that if the (1+ϵ)-approximate solver for the corresponding linear program is a computer, for any ϵ > 0, an extra 1+ϵ factor will appear in the final approximation factor for both problems. A comparison will be carried out the parallel implementation based on GPU and CPU threads with the Gurobi solver, leading to the conclusion that the respective algorithm outperforms the Gurobi solver on large and dense inputs typically by one order of magnitude.

Ključne riječi

1.5D terrain guarding, linear programming, CUDA, approximation algorithm

Hrčak ID:

138580

URI

https://hrcak.srce.hr/138580

Posjeta: 894 *