The focus of attention problem

D. Goossens, S. Polyakovskiy, F.C.R. Spieksma, G.J. Woeginger

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

1 Citaat (Scopus)

Samenvatting

We consider systems of small, cheap, simple sensors that are organized in a distributed network and used for estimating and tracking the locations of targets. The objective is to assign sensors to targets such that the overall expected error of the sensors’ estimates of the target locations is minimized. The so-called focus of attention problem (FOA) deals with the special case where every target is tracked by one pair of range sensors. The resulting computational problem is a special case of the axial three-index assignment problem, a well-known fundamental problem in combinatorial optimization. We provide a complete complexity and approximability analysis of the FOA problem: we establish strong NP-hardness and the unlikeliness of an FPTAS, we identify polynomially solvable special cases, and we construct a sophisticated polynomial time approximation scheme for it.

Originele taal-2Engels
Pagina's (van-tot)559-573
Aantal pagina's15
TijdschriftAlgorithmica
Volume74
Nummer van het tijdschrift2
DOI's
StatusGepubliceerd - 1 feb 2016

Vingerafdruk Duik in de onderzoeksthema's van 'The focus of attention problem'. Samen vormen ze een unieke vingerafdruk.

  • Citeer dit