Skip to main content

Table 6 α k and execution time in a large network model having 300 nodes and 400 edges

From: Computable performance guarantees for compressed sensing matrices

Algo.

α 1

α 2

α 3

α 4

α 5

α 6

(a) α k values

1-Step TSA

0.07

0.13

0.15

0.18

0.20

0.22-0.26a

2-Step TSA

0.07

0.13

0.15

0.18

0.20-0.23a

0.22-0.28a

(b) Execution time (Unit: second)

1-Step TSA

63.37

65.70

599.96

5.49e3

8.60e4

1 day

2-Step TSA

63.37

3.46e4

3.54e4

4.03e4

1 day

1 day

ESM

73.22

3.20e4

1.59e6b

1.58e8b

1.25e10b

8.22e11b

  1. aLower bound - upper bound
  2. bExhaustive search method (estimated operation time = average time to solve (7) (=0.15 second) for an index set × total number of index sets)