Skip to main content

Table 2 Algorithm overview

From: Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization

Abbreviation Parameters Description
ILP Solves Problem (8) using the branch-and-bound-type solver BARON.
Tree Dec.+Rec a β = Non-backtracking version. Uses Algorithms 1 and 2.
  Dec.+BT a β (0,),f β (x)=a β 1.25x−1 Backtracking version. Uses Algorithms 1 and 3.
  Dec.+BT * Genie-aided version of the backtracking algorithm, where the optimal bounds on the data structures are known for each tree node. Uses Algorithms 1 and 3.
\