The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

🎓 Coach ⭐ 103.11K Points

📊 Design and Analysis of Algorithms

Q. The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

💬 Discuss

✅ Correct Answer: (C) maximum weight matching

Explanation: the problem is called as maximum weight matching which is similar to a bipartite matching. it is also called as assignment problem.

the problem is called as maximum weight matching which is similar to a bipartite matching. it is also called as assignment problem.

💬 Discussion

👁️

494

Total Visits

📽️

2 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

97%

Success Rate