Water Rights and Land Values in the West-Central Plains

Irrigation is vital to the economic activity of the west-central Great Plains. The crops grown, the distribution of center-pivot irrigation systems, and the basic transportation infrastructure is the same in northwest Kansas, northeast Colorado, and southwest Nebraska. But buyers of agricultural land face a different price for irrigated cropland in each of the states, even when the production characteristics of the land are similar. After accounting for factors like productivity and local property tax differences, we argue that it is the difference in water marketing rights between the three states that explains the price difference. The link between land values and water marketing rights is statistically developed by using Ordinary Least Squared (OLS) regression techniques. After adjusting for differences in property taxes, the analysis reveals that the implicit value of full water-marketing rights in the region is approximately $1,026 per acre. This valuation is within the range of estimates provided by other comparable studies across the country.

Approximation Algorithms for Survivable Multicommodity Flow Problems with Applications to Network Design

Multicommodity flow (MF) problems have a wide variety of applications in areas such as VLSI circuit design, network design, etc., and are therefore very well studied. The fractional MF problems are polynomial time solvable while integer versions are NP-complete. However, exact algorithms to solve the fractional MF problems have high computational complexity. Therefore approximation algorithms to solve the fractional MF problems have been explored in the literature to reduce their computational complexity. Using these approximation algorithms and the randomized rounding technique, polynomial time approximation algorithms have been explored in the literature. In the design of high-speed networks, such as optical wavelength division multiplexing (WDM) networks, providing survivability carries great significance. Survivability is the ability of the network to recover from failures. It further increases the complexity of network design and presents network designers with more formidable challenges. In this work we formulate the survivable versions of the MF problems. We build approximation algorithms for the survivable multicommodity flow (SMF) problems based on the framework of the approximation algorithms for the MF problems presented in [1] and [2]. We discuss applications of the SMF problems to solve survivable routing in capacitated networks.