Input-Dependent and Asymptotic Approximation. Summary -Approximation algorithm for graph coloring -Approximation algorithm for set cover -Asymptotic approximation.

Slides:



Advertisements
Similar presentations
Covers, Dominations, Independent Sets and Matchings AmirHossein Bayegan Amirkabir University of Technology.
Advertisements

Set Cover 資工碩一 簡裕峰. Set Cover Problem 2.1 (Set Cover) Given a universe U of n elements, a collection of subsets of U, S ={S 1,…,S k }, and a cost.
Approximation Algorithms
Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,
Edge-connectivity and super edge-connectivity of P 2 -path graphs Camino Balbuena, Daniela Ferrero Discrete Mathematics 269 (2003) 13 – 20.
Bart Jansen, Utrecht University. 2  Max Leaf  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least.
Complexity ©D Moshkovitz 1 Approximation Algorithms Is Close Enough Good Enough?
Polynomial Time Approximation Schemes Presented By: Leonid Barenboim Roee Weisbert.
Parallel Scheduling of Complex DAGs under Uncertainty Grzegorz Malewicz.
Combinatorial Algorithms
Lectures on Network Flows
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
CSC5160 Topics in Algorithms Tutorial 2 Introduction to NP-Complete Problems Feb Jerry Le
Introduction to Approximation Algorithms Lecture 12: Mar 1.
Approximation Algorithms
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
Randomized Algorithms and Randomized Rounding Lecture 21: April 13 G n 2 leaves
Implicit Hitting Set Problems Richard M. Karp Harvard University August 29, 2011.
Definition Hamiltonian graph: A graph with a spanning cycle (also called a Hamiltonian cycle). Hamiltonian graph Hamiltonian cycle.
Vertex Cover, Dominating set, Clique, Independent set
NP-Complete Problems Reading Material: Chapter 10 Sections 1, 2, 3, and 4 only.
Computability and Complexity 24-1 Computability and Complexity Andrei Bulatov Approximation.
Coloring Algorithms and Networks. Coloring2 Graph coloring Vertex coloring: –Function f: V  C, such that for all {v,w}  E: f(v)  f(w) Chromatic number.
Backtracking Reading Material: Chapter 13, Sections 1, 2, 4, and 5.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
Graph Coloring.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Design Techniques for Approximation Algorithms and Approximation Classes.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
The Complexity of Optimization Problems. Summary -Complexity of algorithms and problems -Complexity classes: P and NP -Reducibility -Karp reducibility.
Batch Scheduling of Conflicting Jobs Hadas Shachnai The Technion Based on joint papers with L. Epstein, M. M. Halldórsson and A. Levin.
Chapter 15 Approximation Algorithm Introduction Basic Definition Difference Bounds Relative Performance Bounds Polynomial approximation Schemes Fully Polynomial.
Approximation Algorithms
Speaker: Yoni Rozenshein Instructor: Prof. Zeev Nutov.
CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.
Approximation Algorithms for NP-hard Combinatorial Problems Magnús M. Halldórsson Reykjavik University Local Search, Greedy and Partitioning
Mycielski’s Construction Mycielski’s Construction: From a simple graph G, Mycielski’s Construction produces a simple graph G’ containing G. Beginning with.
Unit 9: Coping with NP-Completeness
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
Implicit Hitting Set Problems Richard M. Karp Erick Moreno Centeno DIMACS 20 th Anniversary.
The full Steiner tree problem Theoretical Computer Science 306 (2003) C. L. Lu, C. Y. Tang, R. C. T. Lee Reporter: Cheng-Chung Li 2004/06/28.
NP-completeness NP-complete problems. Homework Vertex Cover Instance. A graph G and an integer k. Question. Is there a vertex cover of cardinality k?
1 Approximation algorithms Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij TexPoint fonts used in EMF. Read the TexPoint manual.
CSE 421 Algorithms Richard Anderson Lecture 27 NP-Completeness Proofs.
Introduction to NP Instructor: Neelima Gupta 1.
Approximation Algorithms by bounding the OPT Instructor Neelima Gupta
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Approximation Algorithms based on linear programming.
Theory of Computational Complexity Probability and Computing Ryosuke Sasanuma Iwama and Ito lab M1.
Proof of correctness of Dijkstra’s algorithm: Basically, we need to prove two claims. (1)Let S be the set of vertices for which the shortest path from.
Approximation Preserving Reductions. Summary -AP-reducibility -L-reduction technique -Examples: MAXIMUM CLIQUE, MAXIMUM INDEPENDENT SET, MAXIMUM 2-SAT,
The Theory of NP-Completeness
8.3.2 Constant Distance Approximations
Richard Anderson Lecture 26 NP-Completeness
Minimum Spanning Tree 8/7/2018 4:26 AM
Graph theory Definitions Trees, cycles, directed graphs.
Lectures on Network Flows
Computability and Complexity
V17 Metabolic networks - Graph connectivity
Coverage Approximation Algorithms
V11 Metabolic networks - Graph connectivity
Vertex Covers, Matchings, and Independent Sets
Graph Coloring.
V12 Menger’s theorem Borrowing terminology from operations research
V11 Metabolic networks - Graph connectivity
Winter 2019 Lecture 11 Minimum Spanning Trees (Part II)
V11 Metabolic networks - Graph connectivity
Autumn 2019 Lecture 11 Minimum Spanning Trees (Part II)
Presentation transcript:

Input-Dependent and Asymptotic Approximation

Summary -Approximation algorithm for graph coloring -Approximation algorithm for set cover -Asymptotic approximation scheme for edge coloring

begin i:=0; U:=V; while U  ø do begin i:=i+1;V[i]:=ø;W:=U;H:=graph induced by W; while W  ø do begin v=node of minimum degree in H; insert v inV[i]; delete v and its neighbors from W; U:=U-V[i] end end. Approximation of graph coloring -Polynomial-time n/logn-approximation algorithm for MINIMUM GRAPH COLORING

Proof We first prove that, if G is k-colorable, then the algorithm uses at most 3|V|/log k |V| colors. -At any iteration of the inner loop, H is k- colorable -Hence, it contains an independent set of at least |W|/k nodes of degree at most |W|(k-1)/k -At least |W|/k nodes will be in W at the next iteration -At least log k |W| iterations of the inner loop -|V[i]| is at least log k |U|

Proof (continued) -As long as |U|  |V|/log k |V|, log k |U|  log k (|V|/log k |V|)  (1/2) log k |V| -When |U|<|V|/log k |V|, at most 2|V|/log k |V| colors have been used -To color the remaining nodes|V|/log k |V| colors suffice -That is, the algorithm uses at most 3|V|/log k |V| colors

Proof (end) -The algorithm uses at most |V|/log m*(G) |V|, that is, at most 3nlog(m*(G))/logn colors -The performance ratio is at most 3n/logn

MINIMUM SET COVER -INSTANCE: Collection C of subsets of a finite set S -SOLUTION: A set cover for S, i.e., a subset C’ of C such that every element in S belongs to at least one member of C’ -MEASURE: |C’|

begin U:=S; C’:=ø; for any c i do c’ i := c i ; repeat i:=index of c’with maximum cardinality; insert c i in C’; U := U-{elements of c’ i }; delete all elements of c i from all c’; until U:=ø end. Johnson’s algorithm -Polynomial-time logarithmic approximation algorithm for MINIMUM SET COVER

Proof -We prove that the performance ratio of the algorithm is at most ∑ 1  i  k (1/i) where k is the maximum cardinality of the sets in C -Let a 1,...,a |C’| be the sequence of indices obtained by the algorithm -Let c j i be the surviving part of c i before index a j has been chosen -The intersection of c i and c j a j is equal to c j i - c j+1 i -l i denote largest index j such that c j i is not empty

First step For any i, H(|c i |)   1  j  C’| (|c i  c j a j |/|c j a j |) where H(n)=  1  i  n (1/i) Proof  1  j  C’| (|c i  c j a j |/|c j a j |)=  1  j  C’| (|c j i |-|c j+1 i |)/|c j a j |)   1  j  l i (|c j i |-|c j+1 i |)/|c j i |)=  1  j  l i  |c j+1 i |+1  k  | c j i | (1/|c j i |)   1  j  l i  1  k  | c j i |-|c j+1 i | (1/(k+|c j+1 i |))   1  j  l i (H(|c j i |)-H(|c j+1 i |)= H(|c 1 i |)=H(|c i |)

Second step For any set cover C’’,  c i  C’’  1  j  |C’| (|c i  c j a j |/|c j a j |)  |C’| Proof  c i  C’’  1  j  |C’| (|c i  c j a j |/|c j a j |) =  1  j  |C’| (1/|c j a j |)  c i  C’’ |c i  c j a j |   1  j  =|C’| (|c j a j |/|c j a j |) = |C’|

Final step H(|c i |)   1  j  C’| (|c i  c j a j |/|c j a j |) and  c i  C*  1  j  C’| (|c i  c j a j |/|c j a j |)  |C’| imply  c i  C* H(|c i |)  |C’| Since |c i |  k, we have that  c i  C* H(k)  |C’|, that is, |C*|H(k)  |C’| Since H(k)  ln k+1  ln n+1, we have that the performance ratio is logarithmic

MINIMUM EDGE COLORING -INSTANCE: Graph G=(V,E) -SOLUTION: A coloring of E, that is, function f such that, for any pair of edges e 1 and e 2 that share a common endpoint, f(e 1 )  f(e 2 ) -MEASURE: Number of colors, i.e., cardinality of the range of f

Vizing’s algorithm -Polynomial-time algorithm to color a graph with at most D+1 colors, where D denotes the maximum degree of the graph begin D:=maximum degree of G; G’:=(V, E’:=ø); // G’ is clearly colorable with D+1 colors repeat add an edge (u,v) of E to E’; extend coloring of G’ without (u,v) into coloring of G’ with at most D+1 colors; E := E-{(u,v)}; until E:=ø end.

Asymptotic approximation scheme -The algorithm returns an edge-coloring with at most D+1 colors -The optimum is at least D -Hence, performance ratio is at most (D+1)/m*(G)  D/D+1/m*(G)=1+ 1/m*(G) -It implies a 2-approximation

Proof -Assume G’ without (u,v) has an edge-coloring with at most D+1 colors -Let µ(v) denote the set of colors that are not used to color an edge incident to v -Clearly, if the coloring uses D+1 colors, then for any v, µ(v)  ø: let c(v) be one of the colors in µ(v)

Proof (continued) -Compute in polynomial-time a sequence of edges (u,x[0]),...,(u,x[s]) such that: -x[0]=v -for any i, the color of (u,x[i]) = c(x[i-1]) -there is no other edge (u,w) such that its color is equal to c(x[s])

First case: c(x[s]) is in µ(u) -In this case, we can simply shift the colors of the sequence in order to obtain the new coloring of G’ -That is, for any i, we color (u,x[i]) with c(x[i])

Second case: c(x[s]) is not in µ(u) -In this case, one edge (u,x[i]) must have been colored with c(x[s]) (since the sequence is maximal) -Hence, c(x[i-1]) = c(x[s]) -We compute in polynomial time a path P i-1 starting from x[i-1] formed by edges whose colors are, alternatively, c(u) and c(x[s])

First subcase: P i-1 does not end in u -Interchange colors c(u) and c(x[s]) in the path, assign color c(u) to (u,x[i]), shift the colors of the subsequence of edges preceding (u,x[i-1])

Second subcase: P i-1 ends in u -Compute in polynomial time a path P s starting from x[s] formed by edges whose colors are, alternatively, c(u) and c(x[s]) -P s does not end in u

-Interchange colors c(u) and c(x[s]) in P s, assign color c(u) to (u,x[s]), and shift the colors of the subsequence of edges preceding (u,x[s])

Class F -APX -Let F be a class of functions -The class F -APX contains all NPO problems P that admit a polynomial-time algorithm A such that, for any instance x of P, R(x, A (x)))  f(|x|), for a given function f  F -P is said to be f(n)-approximable -A is said to be an f(n)-approximation algorithm

Class APTAS -The class APTAS contains all NPO problems P that admit a polynomial-time algorithm A and a constant k such that, for any instance x of P and for any rational r, R(x, A (x,r)))  r+k/m*(x) -The time complexity of A is polynomial in |x| but not necessarily in 1/(r-1) -A is said to be an asymptotic approximation scheme -A is clearly a (r+k)-approximation algorithm

The NPO world NPO APX MAXIMUM SAT MINIMUM VERTEX COVER MAXIMUM CUT PO MINIMUM PATH O(n)-APX O(logn)-APX MINIMUM GRAPH COLORING MINIMUM SET COVER PTASMINIMUM PARTITION APTASMINIMUM EDGE COLORING