Let G = (V,E) be a bipartite graph, but this time it is a weighted graph. The weight of a complete matching is the sum of the weights of its edges. We are interested in finding a minimum-weight complete matching in G. a) Give a legitimate C for a branch-and-bound (B&B) algorithm that finds a minimum-weight complete matching in G, and prove that your C is valid. Your C cannot be just the cost so far. b) Using your C, apply B&B to find a minimum-weight complete matching in the following weighted bipartite graph G: A = (1,2,3), B = (4,5,6,7) E = (((1,4), 3]. [(1,5), 4]. [(1,7). 15]. ((2,4), 1]. |(2,5), 8]. [(2,6), 3]. |(3,4), 3]. [(3,5), 9]. [ (3,6). 51). Show the solution tree. the C of every tree node generated, and the optimal solution. Also, mark the order in which each node in the solution tree is visited
Let G = (V,E) be a bipartite graph, but this time it is a weighted graph. The weight of a
complete matching is the sum of the weights of its edges. We are interested in finding a
minimum-weight complete matching in G.
a) Give a legitimate C for a branch-and-bound (B&B)
complete matching in G, and prove that your C is valid. Your C cannot be just the cost so
far.
b) Using your C, apply B&B to find a minimum-weight complete matching in the following
weighted bipartite graph G: A = (1,2,3), B = (4,5,6,7)
E = (((1,4), 3]. [(1,5), 4]. [(1,7). 15]. ((2,4), 1]. |(2,5), 8]. [(2,6), 3]. |(3,4), 3]. [(3,5), 9]. [ (3,6). 51).
Show the solution tree. the C of every tree node generated, and the optimal solution. Also,
mark the order in which each node in the solution tree is visited.
![](/static/compass_v2/shared-icons/check-mark.png)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 6 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)