16 views

Uploaded by Sunshine Enriquez

Christofides algorithm

- 14 Integration
- graph_theory
- Paper Basketball
- Way Finding in Social Networks
- Eduachievers Chapter 6a
- Cs6702 Graph Theory and Applications Lesson Plan
- Adaptive Graph Pattern Matching
- Gp202mooc Hw4 Solutions
- reflectionsde041.pdf
- 14 Integration
- computer software engineering
- Maths
- Binomial Coefficients Proofs
- Examples With Loops
- MC0063(B)-Unit10-fi
- Taller Raices.xlsx
- class00.pdf
- field tracing_ lateral display y=0
- Graph Theory & Combinatorics Jan 2005 Old
- 1.2 Function Notation

You are on page 1of 5

11/03/03

Instructor: Eric Bach Scribe: Ye Zheng

In the last lecture, we discussed an approximation algorithm for TSP with = 2. Today we will improve the ratio from 2 to 3/2. In order to achieve this, we will use a more sophisticated algorithm and some results from the graph theory.

Euler Tours

The K onigsberg bridge problem asks if the seven bridges of the city of K onigsberg (formerly in Germany but now known as Kaliningrad and part of Russia) over the river Preger can all be traversed in a single trip without doubling back. In addition, we require that the trip ends in the same place it began. See Figure 1 for a depiction of the problem.

Figure 1: The K onigsberg Seven Bridges by Kraitchik 1942 [MR] Euler solved this problem (1736) by showing that it was impossible to satisfy the requirements. His study represented the beginning of graph theory. This problem is equivalent to asking if the multi-graph on four nodes and seven edges (Figure 2) has an Eulerian circuit (Euler tour). Deniton (Euler Tour / Eulerian Circuit). Given a graph G = (V, E ), An Euler tour of G starts and ends at the same graph vertex and visits all vertices. In other words, it is a graph cycle where each graph edge is used exactly once. The term Eulerian circuit is also used synonymously with Euler tour. For technical reasons, Eulerian circuits are mathematically easier to study than are Hamiltonian circuits. As a generalization of the K onigsberg bridge problem, Euler showed (without proof) that a connected graph has an Eulerian circuit if and only if it has no graph vertices of odd degree. Theorem 1. A graph G = (V, E ) has an Euler tour if and only if it is connected and each vertex has even degree.

Figure 2: Abstraction of K onigsberg bridge problem Fleurys algorithm is an elegant method of generating Eulerian circuit. Algorithm 1: Fleurys Algorithm for Euler Tour Input: A connected graph G = (V, E ) Output: An Eulerian circuit of G (1) Start at any vertex v V (2) while untraversed edges remain (3) Select a new edge (v, w) E (avoiding cut edge unless unavoidable) (4) Output (v, w) (5) vw

Note that a cut edge is an edge whose removal disconnects the graph. If we remove the cut edge and there still exists a non-cut edge (say e). We cannot go back to the component that contains e. In addition, we can use the depth rst search to decide whether an edge is a cut-edge or not. So Fleurys algorithm is polynomial time bounded.

Matchings

Deniton (Matching). A matching on a graph G = (E, V ) is a set of edges of G such that no two of them share a vertex in common. The largest possible matching consists of half of the edges, and such a matching is called a perfect matching. Note that although not all graphs have perfect matchings, a maximum matching exists for each graph. There exists a polynomial time algorithm to nd a minimum cost perfect matching in a complete weighted graph (also called the assignment problem). 1 Now we are ready to introduce the 3/2-approximation algorithm.

Christodes Algorithm

Recall that the TSP asks that given a complete undirected graph G(V, E ) that has a non-negative integer cost c(u, v ) associated with each edge (u, v ) E , nd a path which starts and ends at the

1

The assignment problem is the maximum weight matching problem in the bipartite graph.

same vertex (a tour), includes every other vertex exactly once, and minimizes cost. We focus on the cost function which satises the triangle inequality. The cost function c satises the triangle inequality if for all vertices u, v, w V, c(u, w) c(u, v ) + c(v, w) In other words, the cheapest (shortest) way of going from one city to another is the direct route (i.e., straight line) between two cities. In particular, if every city corresponds to a point in Euclidean space, and distance between cities corresponds to Euclidean distance, then the triangle inequality is satised. Algorithm 2: Christodes Algorithm Input: a weighted graph G = (E, V ) Output: a TSP tour (1) Find a minimum spanning tree T of G (2) Let G be subgraph of G induced by vertices of odd degree in T . Then G has even number of vertices. (3) G =complete graph with even number of vertices. Let M be a minimum cost perfect matching of G (4) T + M (multiple edges included) has a Eulerian circuit K by Theorem 1 (5) Take shortcuts in K to get a TSP tour.

Figure 3: Christodes Algorithm In step 1, we nd the Minimum Spanning Tree T1 (the green edges). The sum of degrees of all the vertices S (d) = 2m, where m is the number of edges. Therefore S (d) is even. Let S e (d) to be the sum of degrees of the vertices which have even degree, Se (d) is also even. Therefore S (d) Se (d) = 2k , k = 1, 2, . . . which means that the sum of degrees of the vertices which have odd degree is also an even number. Thus there are even numbers of vertices which have odd degree. In

the example, vertices 4 and 10 have even number degrees. Thus the set of vertices with odd degree is G = {1, 2, 3, 5, 6, 7, 8, 9, 11, 12}. In step 3, we nd a minimum weight matching on the vertices in G . In this example, the minimum matching edges are 1-3,2-5,6-7,8-9,11-12. (see the blue dashed lines in the Figure 3) In order to prove the approximation ratio is 3/2, we need to use the following lemma: Lemma 1. G = (V, E ) is a graph. Let W V with even cardinality |W |, and M be a minimum cut matching for the subgraph induced by W . Then cost(W ) OPT/2 Proof. Take any optimal tour of G and take the shortcuts to make a tour K for W . K = M M has even length where M and M are matchings for W .

M M

Figure 4: Proof of Correctness and Approximation Ratio From the Figure 4, we see that 2 cost of the best matching for W cost(M ) + cost(M ) = cost(K ) cost of the optimal TSP tour where the last inequality follows by the triangle inequality. Now observe that 2 cost of the Christodes tour cost of the Eulerian circuit = cost(K ) + cost(T ) 3 1 OPT + OPT = OPT 2 2

Christodes algorithm is the best known approximation algorithm for the Euclidean TSP. We also can give an example to show that the 1.5 approximation ratio can be reached. The given graph G is shown in Figure 5.

V2

V4

V6

V n3

1 1

V n1

......

V1

V3

V5 (n1)/2

V n2 1

Vn

Figure 5: A bad case for Christodes algorithm The MST of G is the blue edges which cost n 1. So M consists of the edges with cost (n 1)/2. Therefore, Christodes tour has cost 3n/2 + O(1) while the optimal tour has cost n (as shown in red dashed line).

References

[BM] [MR] [HC] A.V. Bondy and U.S.R. Murty. Graph Theory with Applications. Mathematical Recreations, Dover, 1958. http://www.msci.memphis.edu/~giri/7713/f00/HuiChen/HuiChen2.htm#chris.

- 14 IntegrationUploaded byGenien Hong
- graph_theoryUploaded byrws1000
- Paper BasketballUploaded byDaryl Tapia
- Way Finding in Social NetworksUploaded bysingaporeano
- Eduachievers Chapter 6aUploaded byblue_l1
- Cs6702 Graph Theory and Applications Lesson PlanUploaded byappasami
- Adaptive Graph Pattern MatchingUploaded byLászló Forró
- Gp202mooc Hw4 SolutionsUploaded byJose Silva
- reflectionsde041.pdfUploaded byMao Cristhian Pinto Cruz
- 14 IntegrationUploaded bySabariah Ismail
- computer software engineeringUploaded byapi-379378033
- MathsUploaded byAnujGoyal
- Binomial Coefficients ProofsUploaded byyddap
- Examples With LoopsUploaded byAdnan Halapa
- MC0063(B)-Unit10-fiUploaded bySanjeev Malik
- Taller Raices.xlsxUploaded byNathalia Vallejo
- class00.pdfUploaded byShani Arain
- field tracing_ lateral display y=0Uploaded byNorman Girma
- Graph Theory & Combinatorics Jan 2005 OldUploaded byPrasad C M
- 1.2 Function NotationUploaded byBradley Singh
- PrefaceUploaded byNaresh Bansal
- Analysis of Engineering Systems - Homework 1Uploaded byDavid Clark
- Cpt-5 Jee Mains Maths (Top) Held on 14-June-15Uploaded byblue_l1
- 951024Uploaded byLuis Alberto Fuentes
- ana1Uploaded byPrakash Shetty
- Regression Analyisis Using Alogorithm'Uploaded bycnd
- CFP-Graph Theory June12Uploaded byNguyen Huy
- Chapter 20a (Simpson s Rule)-min.pdfUploaded byImran
- Algebraic-Number-Theory-Notes-Anwar-Khan.pdfUploaded bySikandar Khan
- Raheel Phd CoursesUploaded byAnonymous mqIqN5z

- CF1Uploaded byLaurice Viñas
- FAQs on CARPUploaded byMichelleOgatis
- 82 Agent BanksUploaded bySunshine Enriquez
- PAGCOR App Reg FormUploaded bySunshine Enriquez
- SSS Contribution FlyerUploaded byClaribel
- MCLEFormNo02Uploaded bySunshine Enriquez
- Board Resolution [Increse in Paid UP] SampleUploaded bySunshine Enriquez
- Affidavit (Petition for Correction of Articles of Incorporation)Uploaded bySunshine Enriquez
- SEC- Company Registration SystemUploaded bySunshine Enriquez
- Order of PublicationUploaded bySunshine Enriquez
- Affidavit of PublicationUploaded bySunshine Enriquez
- Miranda vs. Tuliao Case DigestUploaded bySunshine Enriquez
- Information PracCourtUploaded bySunshine Enriquez
- Petition for Change of NameUploaded bySunshine Enriquez
- Checklist VisaUploaded bySunshine Enriquez
- Conversion to Pre-Arranged Employee-Commercial 9G(2)Uploaded byAgnes Pajilan
- Annex E Assessment Slip FoodUploaded bySunshine Enriquez
- Pmrf Revised.pdf PMRFUploaded byRosenNipa
- Requirements Issuance of DOLE Clearance(1)Uploaded bySunshine Enriquez
- Presidencial Decree No. 49Uploaded bySunshine Enriquez
- Credit Mutuum Deposit CasesUploaded bySunshine Enriquez
- MCLEForm02BUploaded bySunshine Enriquez
- MCLEForm02AUploaded bySunshine Enriquez
- Mcle Form No. 01Uploaded bySunshine Enriquez
- BIR Guide for Interactive Forms_1701Uploaded bySunshine Enriquez
- Compiled Cases - Easement and NuissanceUploaded bySunshine Enriquez
- Copyright Application FormUploaded byRoberto Evangelista Espino
- Republic Act 9003Uploaded byjozel2108

- Riddler Express SolutionUploaded byEduin Latimer
- CS1201Uploaded byArun Ram Prasath S
- ama41qUploaded byJax Moneke
- Assign5 FinalUploaded byjethrow_away
- Sec 93Uploaded byroufix
- List of NP-Complete problemsUploaded byfakeqwerty
- Fuzzy Threshold GraphUploaded bySovan Samanta
- Even Graph Algorithms PDFUploaded byDanielle
- Graph Theory by Tero HarjuUploaded byabelous
- Lecture 19 - Well Separated Pair DecompositionUploaded bygdenunzio
- Integration Using Trig IdentitiesUploaded byJose Villegas
- 4th_syll_041309050457_1Uploaded bySaket Agrawal
- Graph NoteUploaded byMuhammad Hafiz Haqimi
- Wilson's TheoremUploaded byLăscău Ionut Sebastian
- Skill TirgonoUploaded byMK Joey Tham
- Operations ResearchUploaded byShahid Naseem
- Construction ProblemsUploaded byaugustina8080
- bca iv sem ada qbUploaded byapi-285363432
- Logical-Thinking.pdfUploaded byRaghul Muthu
- error function table.pdfUploaded byPoulami Saanjhbati Dasgupta
- 18 Closures of RelationsUploaded byPreeti Khanna
- AMC-Zagreb-NEPS.pdfUploaded byyuoeyuor
- DS2marksUploaded byPrem Kumaran
- igraphUploaded byeroteme.thinks8580
- EUROMATH 2013, Table for Accepted Abstracts Website (Updated 12 March 2013)Uploaded bysuryaming2012
- Charging ArgumentUploaded bygeorge4012
- NP CompleteUploaded byCuong Tran
- Investigation of the (*) search algorithmsUploaded byNick Sweet
- 05. LogarithmsUploaded bythinkiit
- Day2Uploaded bySri Chandra Duddu