The focus of attention problem
DOI10.1007/S00453-014-9963-8zbMATH Open1332.68074OpenAlexW3157942307MaRDI QIDQ262243FDOQ262243
Authors: S. Polyakovskiy, Frits C. R. Spieksma, Gerhard J. Woeginger, Dries R. Goossens 
Publication date: 29 March 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/488186
Recommendations
assignment problemcomplexityapproximationdistributed sensorsintractable problemsensor assignmenttarget tracking
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Assignment Problems
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Title not available (Why is that?)
- Geometric three-dimensional assignment problems
- Approximation algorithms for multi-index transportation problems with decomposable costs
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Optimal placement of stereo sensors
- Angle Optimization in Target Tracking
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
Cited In (4)
This page was built for publication: The focus of attention problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262243)
