Deakin University
Browse

File(s) under permanent embargo

The focus of attention problem

Version 2 2024-06-04, 14:21
Version 1 2018-05-01, 17:37
journal contribution
posted on 2016-02-01, 00:00 authored by D Goossens, Sergey PolyakovskiySergey Polyakovskiy, F C R Spieksma, G J Woeginger
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.

History

Journal

Algorithmica

Volume

74

Issue

2

Pagination

559 - 573

Publisher

Springer

Location

New York, N.Y.

ISSN

0178-4617

eISSN

1432-0541

Language

eng

Publication classification

C Journal article; C1.1 Refereed article in a scholarly journal

Copyright notice

2014, Springer Science+Business Media New York