Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Stav Ashur"'
Publikováno v:
Algorithmica. 82:2784-2808
In this paper, we study the problem of data gathering in ad-hoc sensor networks using a mobile entity called mule. The mule traverses the children of failed sensors, to prevent loss of data. Our objective is to define the optimal communication tree,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bdee105635fdacdcfa7ef634e7ca926e
https://doi.org/10.1007/s00453-020-00704-8
https://doi.org/10.1007/s00453-020-00704-8
Autor:
Stav Ashur, Matthew J. Katz
Publikováno v:
Computational Geometry. 108:101914
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae61f7c8a8c1394d7b2bd6d2fd0f140b
https://doi.org/10.1016/j.comgeo.2022.101914
https://doi.org/10.1016/j.comgeo.2022.101914
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030808785
WAOA
WAOA
The problem of vertex guarding a simple polygon was first studied by Subir K. Ghosh (1987), who presented a polynomial-time \(O(\log n)\)-approximation algorithm for placing as few guards as possible at vertices of a simple n-gon P, such that every p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::102da4aeb2899f0610c6659a80af1c11
https://doi.org/10.1007/978-3-030-80879-2_6
https://doi.org/10.1007/978-3-030-80879-2_6
Publikováno v:
Computational Geometry. 101:101832
A graph \(G = (V,E)\) is terrain-like if one can assign a unique integer from the range [1..|V|] to each vertex in V, such that, if both \(\{i,k\}\) and \(\{j,l\}\) are in E, for any \(i< j< k < l\), then so is \(\{i,l\}\). We present a local-search-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4efc1398c051e958f2768208a2ec902
https://doi.org/10.1016/j.comgeo.2021.101832
https://doi.org/10.1016/j.comgeo.2021.101832
Publikováno v:
Approximation and Online Algorithms ISBN: 9783030394783
WAOA
WAOA
A graph \(G = (V,E)\) is terrain-like if one can assign a unique integer from the range [1..|V|] to each vertex in V, such that, if both \(\{i,k\}\) and \(\{j,l\}\) are in E, for any \(i< j< k < l\), then so is \(\{i,l\}\). We present a local-search-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a7852b53c748ca4135889f0780fdb7c
https://doi.org/10.1007/978-3-030-39479-0_1
https://doi.org/10.1007/978-3-030-39479-0_1