Recall that nearest neighbor and greedy are heuristic algorithms for the solution of the TSP problem that we covered. Design an example where greedy finds a shorter cycle compared to nearest neighbor. Clearly depict the example and show the results of each of the algorithms in order to illustrate why one of the algorithms finds a shorter cycle compared to the other.

Recall that nearest neighbor and greedy are heuristic algorithms for the solution of the TSP problem that we covered. Design an example where greedy finds a shorter cycle compared to nearest neighbor. Clearly depict the example and show the results of each of the algorithms in order to illustrate why one of the algorithms finds a shorter cycle compared to the other.

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

(c) Suppose that you have access to the sorted weight list in an ascending order in O(1), which of the minimum cost spanning tree algorithms (Prim or Kruskal) would you use to achieve a better running time performance for graph ? Justify why your selected algorithm is better suited for the above graph. Show the final result of the minimum cost spanning tree that you have obtained.
With p processes, where p is a power of 2, derive formulas for the number of receives and additions that process 0 carries out using(a) the original pseudo-code for a global sum (Process 0 directly receives local sums from all other cores), and(b) the tree-structured global sum.
Suppose we want to use UCS and the A* algorithm on the graph below to find the shortest path from node S to node G. Each node is labeled by a capital letter and the value of a heuristic function. Each edge is labeled by the cost to traverse that edge. Perform A*, UCS, and BFS on this graph. Indicate the f, g, and h values of each node for the A*. e.g., S = 0 + 6 = 6 (i.e. S = g(S) + h(S) = f(S)). Additionally, show how the priority queue changes with time. Show the order in which the nodes are visited for BFS and UCS. Show the path found by the A*, UCS, and BFS algorithms on the graph above. Make this example inadmissible by changing the heuristic value at one of the nodes. What node do you choose and what heuristic value do you assign? What would be the A* algorithm solution then.
A mathematician applies the Greedy Algorithm to find the weight of the Hamiltonian circuit formed starting at vertex A. The order of the edges picked so far is AC, AF, BD, and CD. The next edge selected when applying the Greedy Algorithm should be DE BF EF none of these The total weight of the circuit ABDFEA is a) 162 b) 147 c) 172 d) None of these Using the Greedy Algorithm to find an approximate solution to the traveling salesman problem for a circuit starting at vertex D, the first edge to be selected should be BD AC AD none of these
For straight-line distance heuristic, draw the search tree after expansion of each node until the termination of the algorithm for: a) Greedy best-first search (label all node with their h values). What is the solution (list of visited cities) found by the algorithm? b) A* search (label all nodes with their f values). What is the solution (list of visited cities) found by the algorithm?
Solving using DFS on the below graph A come before Z
COM. Given a graph G and a vertex x of G, present an O(m+n) time algorithm that uses DFS to compute and return the number of vertices that are reachable from x in G via a path; x is reachable from itself. Present a complete algorithm
Many forms of cryptography are based on the following discrete log problem. Choose a cyclic group G (produced by one generator g) with finitely many elements. Alice and Bob want to set up a secret communication and need a secret key for that, which becomes a group element from G. They set up the following exchange (the so-called Diffie-Hellman protocol): 1. Alice chooses a secret group element a and sends unsecured g^a to Bob 2.Bob chooses a secret group element b and sends unsecured g^b to Alice 3. Alice calculates (g^b )^a and keeps this group element secret 4.Bob calculates (g^a )^b and keeps this group element secret Since a cyclic group is abelian, Alice and Bob now share the secret key (g^b )^a=(g^a )^b. The blue group elements are publicly known, the red elements are secret. The discrete log problem presented to an eavesdropper is computing say a from the publicly known data G,g,g^a. The naming of the problem comes from the solution a= glog⁡(ga ) which is generally difficult to…
We discussed how Prim’s algorithm runs on a graph G = (V,E)in O(|V|2). However, we also noted that an alternative implementation exists using heaps that runs in O(|E| log |V|). You will need to execute Prim’s algorithm on a large, complete graph. Which of the two implementations should you choose based solely on the Big-Oh complexity analyses listed above? You must justify your answer using Big-Oh notation in terms of |E|and |V|.
Consider the graph below: Provide the MST either as a drawn subgraph or the edges that comprise a valid MST. You may use either algorithm but show your work/rationale . In other words, you cannot just provide the MST to receive credit .
Draw a precedence graph which execution schedule is conflict-serializable. Graph must contain 5 transactions (i.e. 5 vertices) and at least 7 edges.
Find the minimum spanning tree using Prims algorithm and show the process step by step. (I gave here the picture of this question)