Enough to assume that many of the arrangements for the venue where a number of activities, and want to use the venue as small as possible. The design of an effective arrangement of the greedy algorithm. ( this problem is actually the famous graph coloring problem. If every activity as a graph is a vertex, edge connected between incompatible activities. So that adjacent vertices with different colors corresponding to the least number of colors, to find the minimum number of venue

huichang.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．