The focus of attention problem

DOI10.1007/s00453-014-9963-8zbMath1332.68074OpenAlexW3157942307MaRDI QIDQ262243

Frits C. R. Spieksma, Sergey Polyakovskiy, 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

zbMATH Keywords

complexityapproximationtarget trackingassignment problemdistributed sensorsintractable problemsensor assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (1)

Efficient sensor network management for asset localization

Cites Work

• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• 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
• Assignment Problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: The focus of attention problem