Excursions In Modern Mathematics Plus Mylab Math -- Access Card Package (9th Edition)
9th Edition
ISBN: 9780134442228
Author: Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 6, Problem 36E
A space mission is scheduled to visit the moons Callisto (C), Ganymede (G), lo Mimas (M), and Titan (T) to collect rock samples at each and then return to Earth (E). The travel times (in years) are given in the weighted graph shown in Fig. 6-44. (Note: This is the interplanetary TSP discussed in Example 6.11.)
a. Find the nearest-neighbor tour with starting vertex E. Give the total travel time of this tour.
b. Find the nearest-neighbor tour with starting vertex T Write the tour as it would be traveled by an expedition starting and ending at E. Give the total travel time of this tour.
Figure 6-44
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Which of the graph/s above contains an Euler Trail?
Which of the graph/s above is/are Eulerian?
Which of the graph/s above is/are Hamiltonian?
1. Consider the following system.Part A: Graph ?(?) and ?(?) and approximate where ?(?) = ?(?).
1. Write precise mathematical definition for the following terms:a) Eulerian pathb) Matchingc) Complete Bipartite Graph
Chapter 6 Solutions
Excursions In Modern Mathematics Plus Mylab Math -- Access Card Package (9th Edition)
Ch. 6 - For the graph shown in Fig. 6-19, a.find three...Ch. 6 - For the graph shown in Fig. 6-20, a.find three...Ch. 6 - Find all possible Hamilton circuits in the graph...Ch. 6 - Find all possible Hamilton circuits in the graph...Ch. 6 - For the graph shown in Fig.6-23, a. find a...Ch. 6 - For the graph shown in Fig.6-24, a. find a...Ch. 6 - Suppose D,G,E,A,H,C,B,F,D is a Hamilton circuit in...Ch. 6 - Suppose G,B,D,C,A,F,E,G is a Hamilton circuit in a...Ch. 6 - Consider the graph in Fig. 6-25. a. Find the five...Ch. 6 - Consider the graph in Fig.6-26. a. Find all the...
Ch. 6 - Consider the graph in Fig.6-27. a. Find all the...Ch. 6 - Prob. 12ECh. 6 - For the graph in Fig.6-29 a. find a Hamilton path...Ch. 6 - For the graph in Fig.6-30 a. find a Hamilton path...Ch. 6 - Explain why the graph shown in Fig.6-31 has...Ch. 6 - Explain why the graph shown in Fig.6-32 has...Ch. 6 - For the weighted shown in Fig 6-33, a.find the...Ch. 6 - For the weighted graph shown in Fig6-34, a.find...Ch. 6 - For the weighted graph shown in Fig6-35, a.find a...Ch. 6 - For the weighted graph shown in Fig6-36, a.find a...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Prob. 23ECh. 6 - a. How many edges are there in K200? b. How many...Ch. 6 - In each case, find the value of N. a. KN has 120...Ch. 6 - In each case, find the value of N. a. KN has 720...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - A truck must deliver furniture to stores located...Ch. 6 - A social worker starts from her home A, must visit...Ch. 6 - You are planning to visit four cities A, B, C, and...Ch. 6 - An unmanned rover must be routed to visit four...Ch. 6 - For the weighted graph shown in Fig.6-41, i find...Ch. 6 - A delivery service must deliver packages at...Ch. 6 - Prob. 35ECh. 6 - A space mission is scheduled to visit the moons...Ch. 6 - This exercise refers to the furniture truck TSP...Ch. 6 - This exercise refers to the social worker TSP...Ch. 6 - Darren is a sales rep whose territory consists of...Ch. 6 - The Platonic Cowboys are a country and western...Ch. 6 - Find the repetitive nearest-neighbor tour and give...Ch. 6 - Prob. 42ECh. 6 - This exercise is a continuation of Darrens sales...Ch. 6 - This exercise is a continuation of the Platonic...Ch. 6 - Prob. 45ECh. 6 - Prob. 46ECh. 6 - Find the cheapest-link tour and give its cost for...Ch. 6 - Find the cheapest-link tour for the social worker...Ch. 6 - For the Brute-Force Bandits concert tour discussed...Ch. 6 - For the weighted graph shown in Fig.6-47, find the...Ch. 6 - For Darrens sales trip problem discussed in...Ch. 6 - For the Platonic Cowboys concert tour discussed in...Ch. 6 - A rover on the planet Mercuria has to visit six...Ch. 6 - A robotic laser must drill holes on five sites A,...Ch. 6 - Prob. 55ECh. 6 - Prob. 56ECh. 6 - Suppose that in solving a TSP you find an...Ch. 6 - Prob. 58ECh. 6 - Prob. 59ECh. 6 - Prob. 60ECh. 6 - Prob. 61ECh. 6 - If the number of edges in K500 is x and the number...Ch. 6 - Explain why the cheapest edge in any graph is...Ch. 6 - a. Explain why the graph that has a bridge cannot...Ch. 6 - Julie is the marketing manager for a small...Ch. 6 - 66. m by n grid graphs. An m by n grid graph...Ch. 6 - Complete bipartite graphs. A complete bipartite...Ch. 6 - Prob. 68ECh. 6 - Diracs theorem. If G is a connected graph with N...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Mo. For each of the following shaded region in Figure 1, can it be the feasible region of a linear program? arrow_forwardConsider the following table.arrow_forwardQ1- What is the minimum distance between points C and F? Q2- Which of the following is a Hamiltonian Circuit for the given graph? Q3- What is the length of the Hamiltonian Circuit described in Q2? Q4- Which vertex in the given graph has the highest degree?arrow_forward
- Find the domains of the three graphs shown above in part 4 of Question A]arrow_forwardQuestion No. 4: According to the All Pakistan Software Developer Association (APSDA), developers generally spend more than 40 hours each week working on software and web development. The Table 4.1 shows the number of hours worked per week for a sample of 15 Software developers and a sample of 10 Web developers. Table 4.1 Software Developers 56 54 54 49 61 48 58 60 59 53 50 58 55 57 52 Web Developers 47 50 46 47 48 49 46 55 44 42 ---- a) What is the third quartile of spending working hours for Software developers? b) Create a box plot for the number of hours worked for Software developers. c) Create a box plot for the number of hours worked for Web developers. d) Comment on the differences between the box plots for Software & Web developers.arrow_forward45. What is the minimum distance between points C and F? A. 9 B. 10 C. 11 D. 12 46. Which of the following is a Hamiltonian Circuit for the given graph? A. AIBGCDEFHA B. DICBAIHGFED C. FIBAHGCDEF D. GFEIDCBAHG 47. What is the length of the Hamiltonian Circuit described in number 46? A. 35 B. 37 C. 39 D. 41arrow_forward
- 1.Obtaine the shortest path from s to t in the following graph G, where the weights represent distancesarrow_forwardFind the range of the three graphs shown above in part 4 of Questionarrow_forwardThe weight or cost of a path in a weighted graph is the sum of edge weights of a path. The shortest path from a vertex s to a vertex t is the least cost path from s to t. Given the graph below, which of the following path from s to t is the shortest path?arrow_forward
- A city is planning for a road widening. They want to begin at Session Road, go down each street only once, and end at Session Road. Which graph would be best for this scenario? a.) Euler path b.) Hamiltonian path c.) Euler tour d.) Hamiltonian cyclearrow_forwardA municipal solid-waste site for a city must be located at Site A or Site B. After sorting, some of the solid refuse will be transported to an electric powerplant where it will be used as fuel. Data for the hauling of refuse from each site to the power plant are shown in Table P2-4. If the power plant will pay $8.00 per cubic yard of sorted solid waste delivered to the plant, where should the solid-waste site be located? Use the city’s viewpoint and assume that 200,000 cubic yards of refuse will be hauled to the plant for one year only. One site must be selected.arrow_forward1. Consider the following information.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Discrete Mathematics and Its Applications ( 8th I...MathISBN:9781259676512Author:Kenneth H RosenPublisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...MathISBN:9780134392790Author:Beckmann, SybillaPublisher:PEARSON
Thinking Mathematically (7th Edition)MathISBN:9780134683713Author:Robert F. BlitzerPublisher:PEARSON
Discrete Mathematics With ApplicationsMathISBN:9781337694193Author:EPP, Susanna S.Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)MathISBN:9781259985607Author:David Sobecki Professor, Brian A. MercerPublisher:McGraw-Hill Education
Discrete Mathematics and Its Applications ( 8th I...
Math
ISBN:9781259676512
Author:Kenneth H Rosen
Publisher:McGraw-Hill Education
Mathematics for Elementary Teachers with Activiti...
Math
ISBN:9780134392790
Author:Beckmann, Sybilla
Publisher:PEARSON
Thinking Mathematically (7th Edition)
Math
ISBN:9780134683713
Author:Robert F. Blitzer
Publisher:PEARSON
Discrete Mathematics With Applications
Math
ISBN:9781337694193
Author:EPP, Susanna S.
Publisher:Cengage Learning,
Pathways To Math Literacy (looseleaf)
Math
ISBN:9781259985607
Author:David Sobecki Professor, Brian A. Mercer
Publisher:McGraw-Hill Education
Area Between The Curve Problem No 1 - Applications Of Definite Integration - Diploma Maths II; Author: Ekeeda;https://www.youtube.com/watch?v=q3ZU0GnGaxA;License: Standard YouTube License, CC-BY