Weighted online search - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Computer and System Sciences Année : 2023

Weighted online search

Spyros Angelopoulos
Konstantinos Panagiotou
  • Fonction : Auteur

Résumé

We study the general setting of weighted search in which a number of weighted targets are hidden in a star-like environment, and a mobile searcher must locate a subset of targets with aggregate weight at least a given value W. The cost of the strategy is the distance traversed by the searcher, and its performance is measured by the worst-case ratio of the cost incurred by the searcher over the cost of an on optimal, offline strategy. This is the first study of a setting that generalizes several problems in search theory such as searching for a single target and searching for unit-weighted targets. We present and analyze a near-optimal strategy using an approach based on parameterized analysis. This problem formulates settings of resource allocation among parallel tasks under uncertainty; specifically, we demonstrate further applications in the design of interruptible systems based on adaptive scheduling of contract algorithms.
Fichier principal
Vignette du fichier
JCSS-revision.pdf (717.63 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04248699 , version 1 (18-10-2023)

Identifiants

Citer

Spyros Angelopoulos, Konstantinos Panagiotou. Weighted online search. Journal of Computer and System Sciences, 2023, 138, pp.103457. ⟨10.1016/j.jcss.2023.05.002⟩. ⟨hal-04248699⟩
25 Consultations
12 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More