Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 16.2, Problem 1E
Program Plan Intro
To prove that fractional knapsack problem has the greedy-choice property.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Draw the state space tree for the 5-Queen problem with a branching factor of 2. Show a local maxima in the state space tree if Hill Climbing is used to solve the problem. Note that you do not have to draw the whole state space tree. You can make up an initial state of your choice.
Let G be a graph with n vertices. The k-coloring problem is to decide whether the vertices of G can be labeled from the set {1, 2, ..., k} such that for every edge (v,w) in the graph, the labels of v and w are different.
Is the (n-4)-coloring problem in P or in NP? Give a formal proof for your answer. A 'Yes' or 'No' answer is not sufficient to get a non-zero mark on this question.
Given: graph G, find the smallest integer k such that the vertex set V of G contains a set A consisting of k elements satisfying the condition: for each edge of G at least one of its ends is in A. The size of the problem is the number n of vertices in G.
Please help answer problems 3 & 4 from the given information.
3. Find an instance for which the suggested greedy algorithm gives an erroneous answer.
4. Suggest a (straightforward) algorithm which solves the problem correctly.
Chapter 16 Solutions
Introduction to Algorithms
Ch. 16.1 - Prob. 1ECh. 16.1 - Prob. 2ECh. 16.1 - Prob. 3ECh. 16.1 - Prob. 4ECh. 16.1 - Prob. 5ECh. 16.2 - Prob. 1ECh. 16.2 - Prob. 2ECh. 16.2 - Prob. 3ECh. 16.2 - Prob. 4ECh. 16.2 - Prob. 5E
Ch. 16.2 - Prob. 6ECh. 16.2 - Prob. 7ECh. 16.3 - Prob. 1ECh. 16.3 - Prob. 2ECh. 16.3 - Prob. 3ECh. 16.3 - Prob. 4ECh. 16.3 - Prob. 5ECh. 16.3 - Prob. 6ECh. 16.3 - Prob. 7ECh. 16.3 - Prob. 8ECh. 16.3 - Prob. 9ECh. 16.4 - Prob. 1ECh. 16.4 - Prob. 2ECh. 16.4 - Prob. 3ECh. 16.4 - Prob. 4ECh. 16.4 - Prob. 5ECh. 16.5 - Prob. 1ECh. 16.5 - Prob. 2ECh. 16 - Prob. 1PCh. 16 - Prob. 2PCh. 16 - Prob. 3PCh. 16 - Prob. 4PCh. 16 - Prob. 5P
Knowledge Booster
Similar questions
- Bellman-Ford should be changed so that it only visits a vertex v if its SPT parent edgeTo[v] is not already in the waiting list. Cherkassky, Goldberg, and Radzik reported that this heuristic was practical. Show that the worst-case running time is proportional to EV and that it correctly computes the shortest paths.arrow_forwardComputer Science Consider the d-Independent Set problem: Input: an undirected graph G = (V,E) such that every vertex has degree less or equal than d. Output: The largest Independent Set. Describe a polynomial time algorithm Athat approximates the optimal solution by a factor α(d). Your must write the explicit value of α, which may depend on d. Describe your algorithm in words (no pseudocode) and prove the approximation ratio α you are obtaining. Briefly explain why your algorithm runs in polytime.arrow_forwardLet G be a graph with n vertices representing a set of gamers. There is an edge between two nodes if the corresponding gamers are friends. You want to partition the gamers into two disjoint groups such that no two gamers in the same group are friends. Is the problem in P or in NP? Give a formal proof for your answer. A 'Yes' or 'No' answer is not sufficient to get a non-zero mark on this question.arrow_forward
- Prove that this version of the choice problem is NP-complete; Does the graph G have a spanning tree where the biggest cost paid by any point is less than the goal cost?arrow_forwardWe know that when we have a graph with negative edge costs, Dijkstra’s algorithm is not guaranteed to work. (a) Does Dijkstra’s algorithm ever work when some of the edge costs are negative? Explain why or why not. (b) Find an algorithm that will always find a shortest path between two nodes, under the assumption that at most one edge in the input has a negative weight. Your algorithm should run in time O(m log n), where m is the number of edges and n is the number of nodes. That is, the runnning time should be at most a constant factor slower than Dijkstra’s algorithm. To be clear, your algorithm takes as input (i) a directed graph, G, given in adjacency list form. (ii) a weight function f, which, given two adjacent nodes, v,w, returns the weight of the edge between them. For non-adjacent nodes v,w, you may assume f(v,w) returns +1. (iii) a pair of nodes, s, t. If the input contains a negative cycle, you should find one and output it. Otherwise, if the graph contains at least one…arrow_forwardProve Property : The Monte Carlo version of Rabin-Karp substring search is linear-timeand extremely likely to be correct, and the Las Vegas version of Rabin-Karp substring search is correct and extremely likely to be linear-time.arrow_forward
- From the given information please provide a greedy algorithm and estimate it's time complexity. (will thumbs up) Given: a graph G, find the smallest integer k such that the vertex set V of G contains a set A consisting of k elements satisfying the condition: for each edge of G at least one of its ends is in A. The size of the problem is the number n of vertices in G.arrow_forwardImplement the 0/1 Knapsack problem using the following methods: Dynamic Programming and Backtrackingarrow_forwardhow could someone solce this one? The Chinese postman problem: Consider an undirected connected graph and a given starting node. The Chinese postman has to find the shortest route through the graph that starts and ends in the starting node such that all links are passed. The same problem appears for instance for snow cleaning or garbage collection in a city. For a branch-and-bound algorithm, find a possible lower bound function. (Remark: If the problem is to pass through all nodes of the graph, it is called the travelling salesman problem - which needs different solution algorithms, but also of the branch-and-bound type).).arrow_forward
- It was claimed that:(a, b) ≤ (c, d) ⇔ (a < c) ∨ (a = c ∧ b ≤ d) defines a well-ordering on N x N. Show that this is actually the case.arrow_forwardThe low-degree spanning tree problem is as follows. Given a graph G and an integer k, does G contain a spanning tree such that all vertices in the tree have degree at most k (obviously, only tree edges count towards the degree)? For example, in the following graph, there is no spanning tree such that all vertices have a degree at most three. (a) Prove that the low-degree spanning tree problem is NP-hard with a reduction from Hamiltonian path. (b) Now consider the high-degree spanning tree problem, which is as follows. Given a graph G and an integer k, does G contain a spanning tree whose highest degree vertex is at least k? In the previous example, there exists a spanning tree with a highest degree of 7. Give an efficient algorithm to solve the high-degree spanning tree problem, and an analysis of its time complexity.arrow_forwardTrue/False. Give a short explanation. i. Let T be a tree constructed by Dijkstra's algorithm for a weighted connected graph G. T is a spanning tree of G? ii. Let T be a tree constructed by Dijkstra's algorithm for a weighted connected graph G. T is a minimum spanning tree of G? iii. If an NP-complete problem can be solved in linear time, then all NP-complete problems can be solved in linear time. iv. If P # NP, there could be a polynomial-time algorithm for SAT.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education