26. Scheduling Five different charity organizations send trucks on various routes to pick up donations that residents leave on their doorsteps. Charity A covers Main St., First Ave., and State St. Charity B covers First Ave., Second Ave., and Third Ave. Charity C covers State t., City Dr., and Country Lane. Charity D covers City Dr., Second Ave., and Main St. Charity E covers Third Ave., Country Lane, and Fourth Ave. Each charity has its truck travel down all three streets on its route on the same day, but no two charities wish to visit the same streets on the same day. Use graph coloring to design a schedule for the charities. Arrange their pickup routes so that no street is visited twice on the same day by different charities. The schedule should use the least possible number of days.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%
26. Scheduling Five different charity organizations send trucks on various routes
to pick up donations that residents leave on their doorsteps.
Charity A covers Main St., First Ave., and State St.
Charity B covers First Ave., Second Ave., and Third Ave.
Charity C covers State t., City Dr., and Country Lane.
Charity D covers City Dr., Second Ave., and Main St.
Charity E covers Third Ave., Country Lane, and Fourth Ave.
Each charity has its truck travel down all three streets on its route on the same
day, but no two charities wish to visit the same streets on the same day. Use
graph coloring to design a schedule for the charities. Arrange their pickup
routes so that no street is visited twice on the same day by different charities.
The schedule should use the least possible number of days.
Transcribed Image Text:26. Scheduling Five different charity organizations send trucks on various routes to pick up donations that residents leave on their doorsteps. Charity A covers Main St., First Ave., and State St. Charity B covers First Ave., Second Ave., and Third Ave. Charity C covers State t., City Dr., and Country Lane. Charity D covers City Dr., Second Ave., and Main St. Charity E covers Third Ave., Country Lane, and Fourth Ave. Each charity has its truck travel down all three streets on its route on the same day, but no two charities wish to visit the same streets on the same day. Use graph coloring to design a schedule for the charities. Arrange their pickup routes so that no street is visited twice on the same day by different charities. The schedule should use the least possible number of days.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,