There are n cities on a highway with coordinates x1, . . . , xn and we aim to build K < n fire stations to cover these cities. Each fire station has to be built in one of the cities, and we hope to minimize the average distance from each city to the closest fire station. Please give an algorithm to compute the optimal way to place these K fire stations. The algorithm should run in O(Kn^2) time.

Richardson hired j.c. flood company, a plumbing contractor, to correct a stoppage in the sewer line of her house. the plumbing company's 'snake' device, used to clear the line leading to the main sewer, became caught in the underground line. to release it, the company excavated a portion of the sewer line in richardson's backyard. in the process, the company discovered numerous leaks in a rusty, defective water pipe that ran parallel with the sewer line. to meet public regulations, the water pipe, of a type no longer approved for such service, had to be replaced either then or later, when the yard would have to be excavated again. the plumbing company proceeded to repair the water pipe. though richardson inspected the company's work daily and did not express any objection to the extra work involved in replacing the water pipe, she refused to pay any part of the total bill after the company completed the entire operation. j.c. flood company then sued richardson for the costs of labor and material it had furnished. (c) for what, if anything, should richardson be liable? explain."

Considered to be a "super tool" or tool that has high use and high potential for improving project success?

Harmon inc. produces joint products l, m, and n from a joint process. information concerning a batch produced in may at a joint cost of $75,000 was as follows: