Download presentation

Presentation is loading. Please wait.

Published byAnnabella Hendley Modified over 2 years ago

1
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs Jianping Li Department of Mathematics Yunnan University Jointed by M.X. Chen ， J.B. Li, W.D. Li and L.S. Wang

2
Outline Introduction Completeness of the MCPCW Problem Some Approximation Algorithms for the MCPCW Problem Linear Algorithm for the Special Case of the MCPCW Problem Conclusion

3
1. Introduction 1.1 Interval Graph A graph G=(V,E) is called as an interval graph if each vertex v of G can be represented as an open interval I v on the real line such that any pair of distinct vertices u, v ∈ V are connected by an edge in E if and only if I u ∩I v ≠ ∮. The family { I v } v ∈ V is called as an interval representation of G. A graph G=(V,E) is called as an interval graph if each vertex v of G can be represented as an open interval I v on the real line such that any pair of distinct vertices u, v ∈ V are connected by an edge in E if and only if I u ∩I v ≠ ∮. The family { I v } v ∈ V is called as an interval representation of G.

4
1.2 Applications Benzer invented interval graphs to study analysis of DNA chains, i.e., the linearity of the chain for higher organisms, and interval graph aids in locating genes along the DNA sequence. Waterman and Griggs utilized interval graphs to study an important representation of DNA called restriction maps.

5
Papadimitriou and Yannakakis utilized interval graphs to study the scheduling interval-order tasks. Roberts utilized interval graphs to consider the problem of timing of traffic lights to optimize some criterion such as average waiting time. Other applications of interval graphs shall be found in the papers or books of Carlisle, Golumbic, Schrijver and West et al.

6
1.3 Definition Minimum Clique Partition Problem with Minimum Clique Partition Problem with Constrained Weight for Interval Graphs (MCPCW) (MCPCW) Instance: a weighted interval graph G=(V,E;w) with intervals I 1, …, I, possessing weights w 1, …, w n, and a bound B; Instance: a weighted interval graph G=(V,E;w) with intervals I 1, …, I n, possessing weights w 1, …, w n, and a bound B; Question: Find a partition of these n intervals into the smallest number of cliques, such that sum of weights in each clique is not beyond B.

7
In this paper, we prove that this MCPCW problem remains NP-hard in a strong sense and then design some approximation algorithms for it, each possessing constant ratios. Finally, we design an optimal algorithm to solve the problem in linear-time for the special version, where each interval has the same weight.

8
2. Completeness of the MCPCW Problem Theorem 1. The MCPCW problem is NP- hard in a strong sense. (Reduction is from 3-Partition Problem) (Reduction is from 3-Partition Problem) Theorem 2. For any epsilon >0, there is no approximation algorithm having a factor 3/2-epsilon for the MCPCW problem, unless P=NP. (Reduction is from Partition Problem) (Reduction is from Partition Problem)

9
3 Some Approximation Algorithms for MCPCW Problem For any intervals I i with its weight w i, denote integers o(i) and d(i), respectively, as the left endpoint and the right endpoint, located on the real line from left to right. We give a linear order ` ≦ ' on G: for any two intervals I i, I j of G: denote I i ≦ I j if and only if (1) either d(i)< d(j), or (2) d(i)= d(j) and o(i)< o(j), or (3) d(i)= d(j), o(i)= o(j) and w i ≦ w j

10
In order to simply describe our two approximation algorithms for the MCPCW problem, we utilize an optimal algorithm of Tarjan to compute a maximum cardinality independent set in such an interval graph, and this optimal algorithm runs in time O(n). Tarjan’s algorithm is denoted as Max- Set. In order to simply describe our two approximation algorithms for the MCPCW problem, we utilize an optimal algorithm of Tarjan to compute a maximum cardinality independent set in such an interval graph, and this optimal algorithm runs in time O(n). Tarjan’s algorithm is denoted as Max- Set.

11
Algorithm Clique-Partition I Step 1 Use Max-Set to compute a maximum independent set I={I i_1,I i_2,…, I i_r } in G; Step2 Use the Greedy method to obtain r `maximal’ disjoint cliques C 1, …, C r in the consecutive process, where C t contains the interval I i_t, for each 1 ≦ t ≦ r, such that {C 1, C 2,…, C r } is a partition of these n intervals; Step 3 For each clique C j ={I j_1,I j_2,…, I j_{m_j} }, where 1 ≦ j ≦ r and I j_1 =I i_j, choose some suitable cliques as follows: for 1 ≦ t ≦ m j and the `alive cliques' C j 1, …, C j k containing the intervals I j_1,…, I j_{t-1}, add the current interval I j_t into some `alive clique' C j k' if the total weight sum of I j_t and the intervals in the original clique C j k' is not beyond B, where 1 ≦ k' ≦ k, otherwise open a new `alive clique' as C j k+1 to contain the current interval I j_t as the first interval, until t>m j ; Step 4 Output all cliques obtained from the step 3.

12
Algorithm Clique-Partition II Step 1 Use Max-Set to compute a maximum independent set I={I i_1,I i_2,…, I i_r } in G; Step2 Use the Greedy method to obtain r disjoint cliques C 1, …, C r, as in the last algorithm; Step 3 For each clique C j ={I j_1,I j_2,…, I j_{m_j} }, where 1 ≦ j ≦ r and I j_1 =I i_j, index these m j intervals into the decrease order according to their weights, i.e., w(I j_1 ) ≧ w(I j_2 ) ≧ … ≧ w(I j_{m_j} ), then choose some suitable cliques as the sequl: for 1 ≦ t ≦ m j and the `alive cliques' C j 1, …, C j k containing the intervals I j_1,…, I j_{t- 1}, add the current interval I j_t into some `alive clique' C j k' if the total weight sum of I j_t and the intervals in the original clique C j k' is not greater than B, where 1 ≦ k' ≦ k, otherwise open a new `alive clique' as C j k+1 to contain the current interval I j_t as the first interval, until t>m j ; Step 4 Output all cliques obtained from the step 3.

13
For convention, the interval is called as a large interval if this interval has its weight greater than B/2, otherwise the interval is called as a small interval. Algorithm Clique-Partition III Step 1 Put each a large interval I i into a clique C i, and then remove all large intervals from G (the current interval graph G only contains small intervals);

14
Step 2 Sort all small intervals according to the precede rules (1) and (2), i.e, the small intervals in G are sorted as I 1, …, I n' ; Step 3 Depending on the linear order ` ≦ ' on G, choose a `smallest’ element, I min, in the current graph G as the alive interval; and find the `maximal’ clique C from the current graph G to contain such an alive interval I min, all intervals in such a clique C are I i, I i+1, …, I j, where I i =I min ;

15
Step 4 Use the similar method at the step 3 in the algorithm Clique-Partition I, and then obtain m i disjoint cliques C i_1, C i_2, …, C i_{m_i-1} from the current alive clique C, the cliques C i_1, C i_2, …, C i_{m_i-1} must have weights greater than B/2: Step 4.1: If the clique C i_{m_i} has its weight greater than B/2, then put G:=G- ∪ t=1 m_i C i_t and produce the m i cliques C i_1, C i_2, …, C i_{m_i} ;

16
Step 4.2: If m i ≧ 2 and the clique C i_{m_i} has its weight not greater than B/2, then put G:=G- ∪ t=1 m_i-1 C i_t and produce the m i -1 cliques C i_1, C i_2, …, C i_{m_i-1} ; Step 4.3: If m i =1 and the clique C i_{m_i} has its weight not greater than B/2, then put G:=G- C and produce the clique C; Step 5 Continue to execute the step~3 until G= ∮ ; Step 6 Output all cliques obtained from the steps 1 and 4.

17
Theorem 3 The algorithm Clique-Partition I is an approximation algorithm with a factor 3 for the MCPCW problem, its time complexity is O(n 2 ). Theorem 4 The algorithm Clique-Partition II is an approximation algorithm with a factor 5/2 for the CCPI problem, its time complexity is O(nlog n). Theorem 5 The algorithm Clique-Partition III is an approximation algorithm with a factor 2 for the MCPCW problem, its time complexity is O(n 2 ).

18
4. Linear Algorithm for the Special Case of the MCPCW Problem Now we study the MCPCW problem in the version where all intervals have the same weight 1. When we utilize the algorithms Clique-Partition I, II or III on this special version, we obtain a feasible solution whose value is not greater than 3, 5/2 or 2 times that of optimal solution. But when we modify the algorithm Clique-Partition II in some ways, we design an optimal algorithm in the linear-time for the MCPCW problem for the special version.

19
Algorithm Clique-Partition VI Step 1 Sort all intervals of G according to the precede rules~1-2 of the linear order ` ≦ ' on G; Step 2 Choose the smallest element, I min, in G as the alive interval; and find the maximal clique C from G to contain such an alive interval I min, and then sort all intervals in C according to the precede rules 1-2, all intervals in C are sorted as I i_1, I i_2, …, I i_r, here C i_1 = I min ;

20
Step 3 For the current alive clique C={I i_1, I i_2, …, I i_r }, choose the new cliques from C, depending on the following choice regulations: Step 3.1 If r< B, i.e., |C| < B, then output the alive clique C only containing these r intervals; and put G:=G-{I i_1, I i_2, …, I i_r }; Step 3.2 If r ≧ B, set r=sB +r 0, where s=[r/B] and 0 ≦ r 0 **
{
"@context": "http://schema.org",
"@type": "ImageObject",
"contentUrl": "http://images.slideplayer.com/11/3187870/slides/slide_20.jpg",
"name": "Step 3 For the current alive clique C={I i_1, I i_2, …, I i_r }, choose the new cliques from C, depending on the following choice regulations: Step 3.1 If r< B, i.e., |C| < B, then output the alive clique C only containing these r intervals; and put G:=G-{I i_1, I i_2, …, I i_r }; Step 3.2 If r ≧ B, set r=sB +r 0, where s=[r/B] and 0 ≦ r 0
**

21
Step 4 Continue to execute the step 2 until G= ∮ ; Step 5 Output all cliques at the step 3. Theorem 6 The algorithm Clique-Partition VI is a linear optimal algorithm for the special version of the MCPCW problem, where all intervals have the same weight 1.

22
5. Conclusion we study the MCPCW problem, and we proved that this problem is NP-hard in a strong sense and it cannot be approximated within a factor 3/2-epsilon in polynomial-time for any epsilon >0, then we have designed an approximation algorithm with factors 3, 5/2, 2. For further work, we would design some approximation algorithms for the MCPCW problem with factors lower than 2, improving main results. On the other way, we would design some approximation algorithms to possess lower running time.

Similar presentations

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google