Q2. Given the Weight matrix below, Demonstrate using the dynamic algorithm in solving TravellingSales Man Problem.0 8 13 18 203078 104 I1 0 10 766701110 6 2 1 0You can think of the matrix D as:Vertex EmptySet of oneVertexSet of TwoVerticesSet of ThreeiSetVertices1.2.3The cost of the shortest path is:The path is:4)

we have to do dynamic algo to find minimum cost.

Answered: Q2. Given the Weight matrix below,…

Q2. Given the Weight matrix below, Demonstrate using the dynamic algorithm in solving Travelling Sales Man Problem. 08 13 18 20 307810 411 0 10 7 66701I 10 6 2 10

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

5. For the Graph given below, illustrate the Floyd-Warshall algorithm to determine the final D and P matrices and determine the shortest path for the following source and destination. All answers must come from the final D and P matrices. a) From vertex 4 to 3 b) From vertex 3 to 1 2 2 3 5 7 12 3 1
5. For the Graph given below, illustrate the Floyd-Warshall method to determine the final D and P matrices and determine the shortest path for the following source and destination. All answers must come from the final D and P matrices. a) From vertex 4 to 3 b) From vertex 3 to 1 2 2 6 3 5 4 12 3
4. Using Floyd's algorithm, compute the distance matrix for the weight directed graph defined by the following matrix: 0 4 -2] 6 2 3 -3 2 0 4 ∞o 5 0 Show the intermediate matrices after each iteration of the outermost loop.
The following solution designed from a problem-solving strategy has been proposed for finding a minimum spanning tree (MST) in a connected weighted graph G: Randomly divide the vertices in the graph into two subsets to form two connected weighted subgraphs with equal number of vertices or differing by at most Each subgraph contains all the edges whose vertices both belong to the subgraph’s vertex set. Find a MST for each subgraph using Kruskal’s Connect the two MSTs by choosing an edge with minimum wight amongst those edges connecting Is the final minimum spanning tree found a MST for G? Justify your answer.
Problem 3: Consider the following weighted graph: 5 1. Find the length of the shortest path between a and z. 2. Can you think of an algorithm to find the length of a shortest path between all pairs of vertices in a weighted connected simple graph? Show your work.
choose
26. Solve the following a) For the given set U, assume a family of subsets (F) on your own and apply the approximation algorithm to find the set cover. U={2,3,4,6,7,8} b) For the following weighted graph, apply approximation algorithm for solving traveling salesman problem. 3 1 4 2 5 5 27. For the following undirected graph, apply the approximation algorithm to find vertex cover. 2 6 1 3 5 4 7
2. Consider the graph given by the following adjacency list: vertex adjacent vertics 1 2, 3, 4 2 1 3 1, 4 4 1, 3 5 - (a) Draw the corresponding graph. (b) Write down the adjacency matrix A for this graph. Calculate A2. What is the meaning of the entries of matrices A and A2? (c) Starting at vertex 4, use the adjacency matrix algorithm to check for connectivity. Please no plagiarism and also i want clear hand writting. Thanks
Please choose the correct answer
udent question Consider m rectangles, where the i-th rectangle is represented by the x- and y-coordinates Xil < Xi2 and Yil < Yi2 of its vertices. Here we assume that Yil is negative and Yi2 is positive to simplify the solution, i.e., all rectangles intersect with the x-axis. You are further given a set of n >= m points (a1, b1）,（a2，b2），．．．，（an，bn）， and would like to know whether each point is covered by at least one of the rectangles. Design an algorithm for this problem with a running time faster than O(mn), and analyze its correctness and running time.Hint: First use a divide-and-conquer algorithm to find the area covered by the rectangles, so that for any x-coordinate you can find the maximum and minimum y-coordinates covered by the rectangles. Then, process the points one by one.
Use Floyd's algorithm for the Shortest Paths problem 2 (Algorithm 3.4) to construct the matrix D, which contains the lengths of the shortest paths, and the matrix P, which contains the highest indices of the intermediate vertices on the shortest paths, for the following graph. Show the actions step by step. 10 4 3 19 10 5 VA 18 8 5 27 6 15 1 12 95
v1 0 9 0 0 5 0 1 33 9 9 0 9 9 1. Using given matrix P produced by Floyd2 Algorithm restore the path from v3 to 2 that has the minimum cost (shortest path). Hint: use path(r, q) function. P Iv 22 22 ང་ 35 V4 0 50 69 0 6 V7 89 V9 9 5 9 9 0 9 9 0 V4 V5 44 FE 0 0 5 0 0 0 0 9 0 9 0 6 6 6 7 5 9 3 V6 0 9 5 0 1 0 0 9 0 V7 4 8 8 8 0 8 8 ထ 0 0 8 88 6 0 0 2 9 0 9 10 3 v9 8 00 8 8 7 8 0 16 7 7 0