Polynomial-time approximation algorithms for anchor-free TDoA localization

DOI10.1016/J.TCS.2014.04.007zbMath1360.68906OpenAlexW2025395356MaRDI QIDQ742410

Christian Schindelhauer, Johannes Wendeberg

Publication date: 18 September 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.04.007

zbMATH Keywords

approximationlocalizationFPTASTDoA

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Algorithms for sensor systems. 6th international workshop on algorithms for sensor systems, wireless ad hoc networks, and autonomous mobile entities, ALGOSENSORS 2010, Bordeaux, France, July 5, 2010. Revised selected papers
• Some branch and bound techniques for nonlinear optimization
• A self-localization method for wireless sensor networks
• An Automatic Method of Solving Discrete Programming Problems
• Branch-and-Bound Methods: A Survey
• A tree-search algorithm for mixed integer programming problems

This page was built for publication: Polynomial-time approximation algorithms for anchor-free TDoA localization