An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr class="thead"><td align="left">Parameter</td><td align="center">Default value</td></tr><tr><td class="thead-hr" colspan="2"><hr/></td></tr><tr><td align="left">Facilities</td><td align="center">12500</td></tr><tr><td align="left">Block size</td><td align="center">4 K</td></tr><tr><td align="left">Buffer size</td><td align="center">1024 K</td></tr><tr><td align="left">Network radius</td><td align="center">5</td></tr><tr class="table-tr"><td colspan="2"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

The Scientific World Journal

tab2

Table 2

Table 2: An Efficient Algorithm for Maximizing Range Sum Queries in a Road Network 