Before revision:  We demonstrate the application of local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ \frac{1 + \epsilon})
After revision:  We demonstrate the application of local information cost by deriving a lower bound on the communication complexity of computing a (2t-1)-spanner that consists of at most O(n^{1+ 1/t + \epsilon})