### Table 3. Runtimes needed by various grid based strategies for exact solution (without H-boxes) All grid algorithms were terminated after 24 hrs due to the given time constraints. It is easy to see that the order of the nodes plays an important role in the search for the best possible IS. The LP algorithm provided exact solutions for a given approximation only for small instances. Otherwise, the algorithm was stopped after 24 hours runtime. Table 2 shows that both approaches, the grid-based and the LP-based approach, are almost equal with slight quality advantage on the LP side. On the other hand, the grid-based algorithms are easier to operate.

"... In PAGE 12: ... This leads to an additional time saving effect. The runtimes needed for verifying the optimal solution are compared in Table3 . Within this context, verifying an optimal solution implies a complete run of the algorithm.... ..."

### Table 3.1: Parameters used in analysis of regular grid-based shared execution of discrete and con- tinuous location modelling techniques

2005

### Table 2: Average query time (in microseconds), preprocessing time (in hours), and space consumption (in bytes per node) for the grid based approach, for the US road network.

"... In PAGE 8: ... We implemented our algorithms in C++ and ran all our experiments on a Dual Opteron Machine with 8 GB of main memory, running Linux. Table2 give a summary of experimental results for our actual two-level grid approach with a reach based Dijkstra implementation for the local queries. The grid based approach achieves an average query time of 12 microseconds for 99% of all queries.... ..."

### Table 2: Number of points found in the three peaks for the grid based approach of [8] and our straddle algorithm.

"... In PAGE 8: ...right portion of Figure 3 was basically ignored by the grid based approach. Comparison of the number of experiments performed by our straddle algorithm with the grid based ap- proach used by [8] is shown in Table2 . Even with only 10% of the experiments used in the grid approach, we sampled the concordance peak 8 times more frequently, and the second peak 3.... ..."

### Table 2: Number of points found in the three peaks for the grid based approach of [8] and our straddle algorithm.

in Abstract

"... In PAGE 8: ...right portion of Figure 3 was basically ignored by the grid based approach. Comparison of the number of experiments performed by our straddle algorithm with the grid based ap- proach used by [8] is shown in Table2 . Even with only 10% of the experiments used in the grid approach, we sampled the concordance peak 8 times more frequently, and the second peak 3.... ..."

### Table 2: Number of points found in the three peaks for the grid based approach of [9] and our straddle algorithm.

"... In PAGE 8: ...algorithm with the grid based approach used by [9] is shown in Table2 . Even with only 10% of the experiments used in the grid approach, we sampled the concordance peak 8 times more frequently, and the second peak 3.... ..."

### Table 2: Number of points found in the three peaks for the grid based approach of [9] and our straddle algorithm.

in Abstract

"... In PAGE 8: ...algorithm with the grid based approach used by [9] is shown in Table2 . Even with only 10% of the experiments used in the grid approach, we sampled the concordance peak 8 times more frequently, and the second peak 3.... ..."

### Table 1: Comparison of grid-based and topological approaches to map building.

1996

Cited by 81