Eleven cities, denoted by c1, c2, . . . , c11, have applied for admission to a baseball
Chapter 14, Problem 16(choose chapter or problem)
Eleven cities, denoted by c1, c2, . . . , c11, have applied for admission to a baseball league. The league is to be divided into a certain number of divisions. Two cities cannot belong to the same division if the distance between them is 60 miles or less. A matrix D = [dij ] is given where dij represents the distance between cities ci and cj . What is the smallest number of divisions into which the league can be divided? What is one way of dividing the cities into a smallest number of divisions?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer