Polynomial-time approximation algorithms for anchor-free TDoA localization
type: Item
instance of: scholarly article
title: Polynomial-time approximation algorithms for anchor-free TDoA localization
zbMATH Open document ID: 1360.68906
author: Johannes Wendeberg
author: Christian Schindelhauer
published in: Theoretical Computer Science
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 6345741
zbMATH Keywords: FPTAS
zbMATH Keywords: approximation
zbMATH Keywords: TDoA
zbMATH Keywords: localization
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.04.007
OpenAlex ID: W2025395356
cites work: A self-localization method for wireless sensor networks
cites work: Q711352
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: A tree-search algorithm for mixed integer programming problems
cites work: Some branch and bound techniques for nonlinear optimization
cites work: Branch-and-Bound Methods: A Survey
cites work: Q4325546
DOI: 10.1016/J.TCS.2014.04.007
description: scientific article; zbMATH DE number 6345741