There are n bus stations, they are connected by m roads (there is a undirected graph...
There are n bus stations, they are connected by m roads (there is a undirected graph with n vertexes and m edges)
The cost for advertising at bus station i is Ci.
Now, give you two bus stations s, t, design an algorithm: select some bus stations, advertise at these stations, and every route from s to t can go through at least one advertising bus station. Minimize the total cost.
Try to reduce it as a max s-t flow problem.
Homework Answers
Request Answer!
We need at least 10 more requests to produce the answer.
0 / 10 have requested this problem solution
The more requests, the faster the answer.
Add Answer to:
There are n bus stations, they are connected by m roads (there
is a undirected graph...
An undirected bipartite graph has n vertices and m edges. a) If the graph is connected,...
An undirected bipartite graph has n vertices and m edges. a) If the graph is connected, what is the minimum number of edges? b) If the graph is disconnected, what is the maximum number of edges? c) What is the longest single path? d) If the path can pass through a vertex and not any edges more than once, What is the longest path? Kindly provide me with an example for me to relate
A company named RT&T has a network of n switching stations connected by m high-speed communication...
A company named RT&T has a network of n switching stations connected by m high-speed communication links. Each customer’s phone is directly connected to one station in his or her area. The engineers of RT&T have developed a prototype video-phone system that allows two customers to see eachother during a phone call. In order to have acceptable image quality, however, the number of links used to transmit video signals between the two parties cannot exceed 4. Suppose that RT&T network...
Problem 5. (15 marks) Given a connected, undirected, weighted graph G- (V, E), define the cost...
Problem 5. (15 marks) Given a connected, undirected, weighted graph G- (V, E), define the cost of a spanning tree to be the maximum weight among the weights associated with the edges of the spanning tree. Design an efficient algorithm to find the spanning tree of G which maximize above defined cost What is the complexity of your algorithm.
2. Let G = (V, E) be an undirected connected graph with n vertices and with...
2. Let G = (V, E) be an undirected connected graph with n vertices and with an edge-weight function w : E → Z. An edge (u, v) ∈ E is sparkling if it is contained in some minimum spanning tree (MST) of G. The computational problem is to return the set of all sparkling edges in E. Describe an efficient algorithm for this computational problem. You do not need to use pseudocode. What is the asymptotic time complexity of...
How much work must Kruskal's MST algorithm do before it starts choosing edges for its MST? Assume the undirected graph has n vertices and m edges. Explain the necessary preliminary work and its b...
How much work must Kruskal's MST algorithm do before it starts choosing edges for its MST? Assume the undirected graph has n vertices and m edges. Explain the necessary preliminary work and its big-O cost if done efficiently What are the best case and worst case for Kruskal's MST algorithm with parameters n and/or m? Explain your answer.
How much work must Kruskal's MST algorithm do before it starts choosing edges for its MST? Assume the undirected graph has n...
1. Here is a randomized algorithm for MAX-CUT on an undirected graph G = (V,E): 1....
1. Here is a randomized algorithm for MAX-CUT on an undirected graph G = (V,E): 1. Initialize S to be the empty set 2. For every vertex v in V: 3. Put v into S with probability 1/2 4. Let T = V\S be the complement of S 5. Output (S,T) Recall that E(S, T) CE is the set of edges that have one endpoint in S and the other endpoint in T, ie., E(S, T) = {(u, u) :...
Problem 3's picture are given below. 5. (a) Let G = (V, E) be a weighted connected undirected simple graph. For n...
Problem 3's picture are given below.
5. (a) Let G = (V, E) be a weighted connected undirected simple graph. For n 1, let cycles in G. Modify {e1, e2,.. . ,en} be a subset of edges (from E) that includes no Kruskal's algorithm in order to obtain a spanning tree of G that is minimal among all the spanning trees of G that include the edges e1, e2, . . . , Cn. (b) Apply your algorithm in (a)...
Question 1: Given an undirected connected graph so that every edge belongs to at least one...
Question 1: Given an undirected connected graph so that every edge belongs to at least one simple cycle (a cycle is simple if be vertex appears more than once). Show that we can give a direction to every edge so that the graph will be strongly connected. Question 2: Given a graph G(V, E) a set I is an independent set if for every uv el, u #v, uv & E. A Matching is a collection of edges {ei} so...
There exists a haunted maze which contains n scare stations, with a designated starting station s...
There exists a haunted maze which contains n scare stations, with a designated starting station s and a final station t. To model the haunted maze as a graph, there is a vertex for each scare station and a directed edge from one station to another if it is easy to walk between the two directly (note: because the owners of the haunted house place a restriction on which houses you can visit, the edge between the two scare stations...
Other answer is incorrect Problem 1. (15 points) Consider an undirected connected graph G = (V,...
Other answer is incorrect
Problem 1. (15 points) Consider an undirected connected graph G = (V, E) with edge costs ce > 0 for e € E which are all distinct. (a) [8 points). Let E' CE be defined as the following set of edges: for each node v, E' contains the cheapest of all edges incident on v, i.e., the cheapest edge that has v as one of its endpoints. Is the graph (V, E') connected? Is it acyclic?...
Problem 5. (15 marks) Given a connected, undirected, weighted graph G- (V, E), define the cost of a spanning tree to be the maximum weight among the weights associated with the edges of the spanning tree. Design an efficient algorithm to find the spanning tree of G which maximize above defined cost What is the complexity of your algorithm.
How much work must Kruskal's MST algorithm do before it starts choosing edges for its MST? Assume the undirected graph has n vertices and m edges. Explain the necessary preliminary work and its big-O cost if done efficiently What are the best case and worst case for Kruskal's MST algorithm with parameters n and/or m? Explain your answer.
How much work must Kruskal's MST algorithm do before it starts choosing edges for its MST? Assume the undirected graph has n...
1. Here is a randomized algorithm for MAX-CUT on an undirected graph G = (V,E): 1. Initialize S to be the empty set 2. For every vertex v in V: 3. Put v into S with probability 1/2 4. Let T = V\S be the complement of S 5. Output (S,T) Recall that E(S, T) CE is the set of edges that have one endpoint in S and the other endpoint in T, ie., E(S, T) = {(u, u) :...
Problem 3's picture are given below.
5. (a) Let G = (V, E) be a weighted connected undirected simple graph. For n 1, let cycles in G. Modify {e1, e2,.. . ,en} be a subset of edges (from E) that includes no Kruskal's algorithm in order to obtain a spanning tree of G that is minimal among all the spanning trees of G that include the edges e1, e2, . . . , Cn. (b) Apply your algorithm in (a)...
Other answer is incorrect
Problem 1. (15 points) Consider an undirected connected graph G = (V, E) with edge costs ce > 0 for e € E which are all distinct. (a) [8 points). Let E' CE be defined as the following set of edges: for each node v, E' contains the cheapest of all edges incident on v, i.e., the cheapest edge that has v as one of its endpoints. Is the graph (V, E') connected? Is it acyclic?...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago