《计算模型与算法技术教学课件》12-Coping with the Limitations of Algorithm Power.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Traveling Salesman Problem a lb=14 0 For example, for all the Hamiltonian circuits of the graph in Figure 12.9a that must include edge (a, d), we get the following lower bound by summing up the lengths of the two shortest edges incident with each of the vertices, with the required inclusion of edges (a, d) and (d, a): Traveling Salesman Problem a lb=14 0 a,b lb=14 1 a,c 2 a,d lb=16 3 a,e lb=19 4 Traveling Salesman Problem a lb=14 0 a,b lb=14 1 a,c 2 a,d lb=16 3 a,e lb=19 4 X lb = l of node11 X lb l of node 11 X b is not before