Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

More documents

Recommendations

Info

10/52Fast Exponential-Time AlgorithmsIndependence and ColoringColoring a graphColoringDefinition (Coloring)A function c : V → {1, 2, ..., k} is a proper coloring of a graphG = (V , E) if uv ∈ E implies c(u) ≠ c(v)Definition (Minimum Coloring)Given a graph G = (V , E), compute a coloring of G with thesmallest number of colors.abdcfe
11/52Fast Exponential-Time AlgorithmsDynamic ProgrammingDynamic ProgrammingClassical algorithm design techniqueO(n 2 2 n ) time algorithm for TSP [Held,Karp ; 1962]O(2.4422 n ) time algorithm for Coloring [Lawler ; 1967]
Page 1 and 2: Fast Exponential-Time Algorithms/52
Page 3 and 4: 3/52Fast Exponential-Time Algorithm
Page 5 and 6: 52Fast Exponential-Time AlgorithmsI
Page 11: 10/52Fast Exponential-Time Algorith
Page 15 and 16: 13/52Fast Exponential-Time Algorith
Page 49 and 50: x v, we can discard its mirrors as
Page 51 and 52: well without modifying the maximum7
Page 63 and 64:
48/52Fast Exponential-Time Algorith
Page 65 and 66:
Fast Exponential-Time AlgorithmsCon
Page 67:
Fast Exponential-Time AlgorithmsCon
show all

Fast Exponential-Time Algorithms to solve NP-complete ... - Lita

Create successful ePaper yourself

Delete template?

Save as template?