Q 74

The best-known guarantee for a heuristic algorithm for a traveling salesman problem yields a cost no worse than one and a half times the optimal cost.

Q 75

When Kruskal's algorithm is used to find a minimum-cost spanning tree on a graph, which of the following is false?
A) Circuits are not permitted in the tree.
B) The tree contains the edge of the graph of minimum cost.
C) The tree is not necessarily connected.
D) The tree may contain the edge of the highest cost.

Q 76

A spanning tree of a graph must contain every vertex of the graph.