Problem 1. Consider the following variant of the MST problem. We are given an un

Question

Problem 1. Consider the following variant of the MST problem. We are given an undirected graph G (V, E), edge costs c E Rt and a subset of vertices A C V. The leaf constrained MST problem is to find a subset X C E of edges of minimum cost such that (V, X) is connected and degx(u) 1 for all u E A. Your task is to design an algorithm for the leaf-constrained MST problem that runs in polynomial time. Remember to: a) describe your algorithm in plain English, b) prove it correctness, and c analyze its time complexity.

Explanation / Answer

An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem

http://www.sciencedirect.com/science/article/pii/S1568494608001257

Leaf constrained minimal spanning trees solved by modified quantum-behaved particle swarm optimization

http://link.springer.com/article/10.1007%2Fs10462-010-9158-x

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.