Approximation Algorithm For Minimum Q-Dominator Partization Problem
Approximation Algorithm For Minimum Q-Dominator Partization Problem
Sayani Das
Theoretical Computer Sciences
The Institute of Mathematical Sciences
Chennai 600113, India
[email protected]
Sounaka Mishra∗
Department of Mathematics
IIT Madras, Chennai 600036, India
[email protected]
Communicated by Dachuan Xu
1. Introduction
We consider a simple undirected graph G = (V, E) with vertex set V and edge set
E. Throughout this paper, we assume that |V | = n and |E| = m. A subset I ⊆ V
∗ Corresponding author.
2250188-1
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
2250188-2
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
2. Minimum 2-Dominator-Partization
Here, we will consider the approximability of Min-2-D-Partz based on the charac-
terization of 2-dominator colorable graphs given in Proposition 2.1.
Proposition 2.1 ([3, 12]). If G = (V, E) is a graph with χd (G) ≤ 2, then G
satisfies one of the following propertie:
(i) G is isomorphic to K1 ,
(ii) G is isomorphic to 2K1 ,
2250188-3
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Theorem 2.5. If the unique games conjecture is true then Min-2-D-Partz cannot
be approximated within (2 − ε), for any ε > 0.
Now, we prove that Min-2-D-Partz has a two-factor approximation algorithm
and it is the best possible approximation factor because of Theorem 2.5. In polyno-
mial time it could be verified whether χd (G) ≤ 2 (Proposition 2.1). For a given graph
G, we want to compute a minimum size vertex set S such that χd (G[V \S]) ≤ 2.
If χd (G[V \S]) = 1 then a minimum size S can be computed in polynomial
time. It remains to compute a minimal 2-dominator partization set S such that
χd (G[V \S]) = 2, or G[V \S] is a biclique. In this case, Min-2-D-Partz is same
as minimum biclique deletion problem (Min-Biclique-Del). Given a graph G, in
Min-Biclique-Del, aim is to compute a vertex set S ⊆ V such that G[V \S] is a
biclique and the vertex set S is called biclique deletion set. Min-Biclique-Del is
a known NP-complete problem. There is a two-factor approximation algorithm for
Min-Biclique-Del based on an integer linear program formulation [16]. We design
a 2 factor approximation algorithm which is combinatorial in nature and is indepen-
dent of any integer linear program formulation. While designing this algorithm, we
consider a variation called minimum restricted biclique deletion problem (in short
Min-R-Biclique-Del) and prove similar hardness results. Min-R-Biclique-Del is
defined as, given a graph G = (V, E) and a vertex bipartition V = A ∪˙ B, it is
2250188-4
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
required to find a subset S ⊆ V of minimum size such that G[V \S] is a biclique
with vertex bipartition X ∪˙ Y such that X ⊆ A and Y ⊆ B and the deletion set S
is called a restricted biclique deletion set.
Here, we prove that Min-Biclique-Del and Min-R-Biclique-Del are APX-
complete and they cannot be approximated within a factor smaller than 2. Our
approximation algorithm for Min-2-D-Partz is based on the approximation algo-
rithms for Min-Biclique-Del and Min-R-Biclique-Del.
2250188-5
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
By using Proposition 2.4 and Theorem 2.6 we have the following lower bound
result.
Proof. We denote the vertex deletion set associated with the cross edge (x, y) by
∗
Mxy . We define Mxy as the minimum vertex deletion set associated with the cross
∗
edge (x, y). Let F be a minimum size restricted biclique deletion set in the graph
G with respect to the vertex bipartition A ∪ B. Let (x∗ , y ∗ ) be a cross edge such
that F ∗ = Mx∗∗y∗ . Also, let Cx∗∗ y∗ be a minimum size vertex cover in Hx∗ y∗ . Let
Fapx be the solution of Min-R-Biclique-Del for G computed by Algorithm 1 and
2250188-6
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
The last inequality follows from the fact that Cx∗ y∗ is a two-factor approximate
vertex cover in the graph Hx∗ y∗ .
2250188-7
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Finally, we compute Ax y = Tx y ∪ Nx y ∪ Rx y as the vertex deletion set associ-
ated with the edge (x , y ). We write this algorithm formally in Algorithm 2. Rx y
can be computed in polynomial time by Algorithm 1. All other steps take constant
time to run. Hence Algorithm 2 runs in polynomial time.
Theorem 2.9. Min-Biclique-Del can be approximated within a factor of 2.
Proof. We denote the vertex deletion set associated with the edge (x , y ) by Ax y .
We define A∗x y as the minimum vertex deletion set associated with the edge (x , y ).
Let S ∗ be an optimal solution of Min-Biclique-Del for G. Let (x∗ , y ∗ ) be the edge
such that R∗ = A∗x∗ y∗ . Also, let Rx∗ ∗ y∗ be a minimum size restricted biclique deletion
set in Ux∗ y∗ . Let Sapx be the solution of Min-Biclique-Del for G computed by
Algorithm 2 and (x1 , y1 ) be the corresponding edge.
|Sapx | |Ax y | |Tx1 y1 | + |Nx1 y1 | + |Rx1 y1 |
= ∗1 1 =
|S ∗ | |Ax∗ y∗ | |Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ ∗ y∗ |
|Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ y∗ |
≤
|Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ ∗ y∗ |
(∵ |Tx1 y1 | + |Nx1 y1 | + |Rx1 y1 | ≤ |Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ y∗ |)
|Rx∗ y∗ |
≤ (∵ |Rx∗ ∗ y∗ | ≤ |Rx∗ y∗ |)
|Rx∗ ∗ y∗ |
≤ 2.
2250188-8
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
The last inequality follows from the fact that Rx∗ y∗ is a two-factor approximate
restricted biclique deletion set in the graph Ux∗ y∗ .
3. Minimum 3-Dominator-Partization
In this section, we show that Min-3-D-Partz is APX-hard and we design an
√
O( log n) factor approximation algorithm for it. A subset O ⊆ V is an odd cycle
transversal in G if O has a nonempty intersection with every odd cycle in G. In
Min-OCT it is required to find an odd cycle transversal of minimum size in a given
simple graph G.
Proposition 3.1 ([17]). If unique games conjecture is true then Min-OCT does not
admit a constant factor approximation algorithm.
2250188-9
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
2250188-10
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
2250188-11
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Algorithm 3: Deletion-type-2(G).
Input: G = (V, E) such that there exists a vertex set S with G[V \S] ∈ F2
Output: S2 ⊆ V such that G[V \S2 ] ∈ F2
S2 = ∅; temp = n;
for each vertex v ∈ V do
Construct the subgraph Gv = G[V \N [v]];
Compute a biclique deletion set Xv in G[V \N [v]] by using Algorithm 2;
Sv = Xv ∪ N (v);
if |Sv | < temp then
S2 = Sv ;
temp = |S2 |;
end
end
Return S2 ;
Lemma 3.8. Let G be a graph such that it has a minimum size 3-dominator par-
tization set S2∗ with G[V \S2∗ ] ∈ F2 . Then S2 = Deletion-type-2(G) is a 2 factor
approximate solution.
Proof. Let S2∗ be a minimum size 3-dominator partization set in G such that
G[V \S2∗ ] ∈ F2 . Let v ∗ be the vertex that forms the component with only one
vertex and let Xv∗∗ be the minimum biclique deletion set in G[V \N [v ∗ ]]. Let Xv∗∗ =
Tx∗y∗ ∪ Nx∗ y∗ ∪ Rx∗ ∗ y∗ as described in the proof of Theorem 2.9. By following the
notations from the proof of Theorem 2.9, we can write S2 = N (v) ∪ Txy ∪ Nxy ∪ Sxy
for some edge (x, y) in G[V \N [v]].
|S2 | |N (v)| + |Txy | + |Nxy | + |Rxy |
=
|S2∗ | |N (v ∗ )| + |Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ ∗ y∗ |
|N (v ∗ )| + |Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ y∗ |
≤
|N (v ∗ )| + |Tx∗ y∗ | + |Nx∗ y∗ | + |Rx∗ ∗ y∗ |
(∵ |N (v)| + |Txy | + |Nxy | + |Rxy | ≤ |N (v ∗ )|
+ |Tx∗y∗ | + |Nx∗ y∗ | + |Rx∗ y∗ |)
2250188-12
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
|Rx∗ y∗ |
≤ (∵ |Rx∗ ∗ y∗ | ≤ |Rx∗ y∗ |)
|Rx∗ ∗ y∗ |
≤ 2.
The last inequality follows from the fact that Rx∗ y∗ is a 2 factor approximate
restricted biclique deletion set in the graph Ux∗ y∗ .
Lemma 3.9. Let G be a graph such that it has a minimum size 3-dominator par-
tization set S3∗ with G[V \S3∗ ] ∈ F3 . Then S3 = Deletion-Type-3(G) is a two-factor
approximate solution.
Proof. Let S3∗ = Tx∗ y∗ ∪ Sx∗∗ y∗ be a minimum 3-dominator partization set and the
corresponding non-adjacent pair of vertices be x∗ and y ∗ . Let p∗ ∈ N (x∗ )\N (y ∗ )
and q ∗ ∈ N (y ∗ )\N (x∗ ) such that Sx∗∗ y∗ = Sp∗∗ q∗ and Sp∗∗ q∗ is a minimum restricted
vertex cover in the subgraph G[N (x∗ ) ∪ N (y ∗ )]. Now
|S3 | |Txy | + |Sxy | |Txy | + |Sxy | |Tx∗ y∗ | + |Sp∗ q∗ |
= = ≤
|S3∗ | |Tx∗ y∗ | + |Sx∗∗ y∗ | |Tx∗ y∗ | + |Sp∗∗ q∗ | |Tx∗ y∗ | + |Sp∗∗ q∗ |
(∵ |Txy | + |Sxy | ≤ |Tx∗ y∗ | + |Sx∗ y∗ | ≤ |Tx∗ y∗ | + |Sp∗ q∗ |)
|Sp∗ q∗ |
≤ (∵ |Sp∗∗ q∗ | ≤ |Sp∗ q∗ |)
|Sp∗∗ q∗ |
≤2 (∵ Sp∗ q∗ is a two-factor approximate solution for Min-R-VC).
2250188-13
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Algorithm 4: Deletion-type-3(G).
Input: G = (V, E) such that there exists a vertex set S with G[V \S] ∈ F3
Output: S3 ⊆ V such that G[V \S3 ] ∈ F3
S3 = ∅; temp = n;
for each pair of non-adjacent vertices x, y ∈ V do
Txy = V \[N [x] ∪ N [y]];
for each pair of vertices p ∈ N (x)\N (y) and q ∈ N (y)\N (x), compute a
two-factor approximate restricted vertex cover Spq in G[N (x) ∪ N (y)]
with respect to vertices p and q;
Select a restricted vertex cover Sxy such that it is of least size among the
restricted vertex covers Spq in G[N (x) ∪ N (y)];
Pxy = Txy ∪ Sxy ;
if |Pxy | < temp then
S3 = Pxy ;
temp = |S3 |;
end
end
Return S3 ;
2250188-14
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
or both, A\Oxy is an independent set and each vertex in A\Oxy is adjacent to each
vertex in B\Oxy in G. Observe that, G[B\Oxy ] is a bipartite graph. If G[B\Oxy ]
contains at least one edge then G[V \Dxy ] ∈ F4 , otherwise G[V \Dxy ] ∈ F1 . Hence,
Dxy = Txy ∪ Oxy is 3-dominator partization set in G with respect to the ordered
pair x, y . Finally we select the one with minimum size as among all Dxy as S4 .
For a formal description, we refer to Algorithm 5. Since computing Oxy takes poly-
nomial time and other steps take constant time, Algorithm 5 runs in polynomial
time.
Algorithm 5: Deletion-type-1&4(G).
Input: G = (V, E) such that there exists a vertex set S with
G[V \S] ∈ F1 ∪ F4
Output: S4 ⊆ V such that G[V \S4 ] ∈ F1 ∪ F4
S4 = ∅; temp = n;
for each ordered pair < x, y > of adjacent vertices x, y ∈ V do
Txy = V \[N [x] ∪ N [y]];
√
Construct the graph Hxy and compute a O( log n) factor odd cycle
transversal Oxy in it;
Sxy = Txy ∪ Oxy ;
if |Sxy | < temp then
S4 = Sxy ;
temp = |S4 |;
end
end
Return S4 ;
Lemma 3.10. Let G be a graph such that it has a minimum size 3-dominator
partization set S4∗ with G[V \S4∗ ] ∈ F1 ∪ F4 . Then S4 = Deletion-Type-1&4(G) is a
√
O( log n) factor approximate solution.
Proof. Let S4∗ = Tx∗ y∗ ∪ Ox∗∗ y∗ be a minimum 3-dominator partization set and
the corresponding order pair < x∗ , y ∗ > of adjacent pair of vertices be x∗ and y ∗ .
√
Here, Ox∗∗ y∗ and Ox∗ y∗ are a minimum size odd cycle transversal and a O( log n)-
approximate odd cycle transversal in the subgraph G[N [x∗ ] ∪ N [y ∗ ]], respectively.
Now
|S4 | |Txy | + |Oxy |
=
|S4∗ | |Tx∗ y∗ | + |Ox∗∗ y∗ |
|Tx∗ y∗ | + |Ox∗ y∗ |
≤
|Tx∗ y∗ | + |Ox∗∗ y∗ |
(∵ |Txy | + |Oxy | ≤ |Tx∗ y∗ | + |Ox∗ y∗ |)
2250188-15
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
|Ox∗ y∗ |
≤ (∵ |Ox∗∗ y∗ | ≤ |Ox∗ y∗ |)
|Ox∗∗ y∗ |
≤ O( log n) (∵ Ox∗ y∗ is a O( log n) factor approximate solution).
2250188-16
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Algorithm 6: Deletion-type-5(G).
Input: G = (V, E) such that there exists a vertex set S with G[V \S] ∈ F5
Output: S5 ⊆ V such that G[V \S5 ] ∈ F5
S5 = ∅; temp = n;
for each induced path P4 =< x1 , x2 , x3 , x4 > do
Construct the vertex weighted graph HP4 associated with P4 ;
Compute 2 factor weighted vertex cover CP4 in the graph HP4 ;
Construct the set SP4 = TP4 ∪ CP4 ;
if |SP4 | < temp then
S5 = SP4 ;
temp = |S5 |;
end
end
Return S5 ;
set Z = {v | v ∈ (X1 ∪ X4 ) and v is adjacent to every vertex in (X2 ∪ X3 )}. Finally,
we define the sets X1 = X1 \Z and X4 = X4 \Z. Now, the sets X1 , X2 , X3 , X4 and
Z satisfies the conditions for the graph class F5 .
Construction of the weighted graph HP4 and computation of the weighted vertex
cover CP4 take polynomial time. Other steps take constant time. Hence Algorithm 6
runs in polynomial time.
Lemma 3.12. Let G be a graph such that it has a minimum size 3-dominator
partization set S5∗ with G[V \S5∗ ] ∈ F5 . Then S5 = Deletion-type-5(G) is a two-
factor approximate solution.
≤ 2.
The last inequality follows from the fact that CP4∗ is a two-factor approximate
weighted vertex cover in the graph HP4∗ .
2250188-17
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Lemma 3.13. Let G be a graph such that it has a minimum size 3-dominator
partization set S6∗ with G[V \S6∗ ] ∈ F6 . Then S6 = Deletion-type-6(G) is a 2 factor
approximate solution.
2250188-18
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Algorithm 7: Deletion-type-6(G).
Input: G = (V, E) such that there exists a vertex set S with G[V \S] ∈ F6
Output: S6 ⊆ V such that G[V \S6 ] ∈ F6
S6 = ∅; temp = n;
for each P M5 = x, x1 , x2 , x3 , x4 do
Construct the vertex weighted graph HP M5 associated with P M5 ;
Compute two-factor vertex cover CP M5 in the graph HP M5 ;
Construct the set DP M5 = TP M5 ∪ CP M5 ;
if |DP M5 | < temp then
S6 = DP M5 ;
temp = |S6 |;
end
end
Return S6 ;
associated with S6∗ . Then S6∗ = TP M5∗ ∪ CP∗ M5∗ with CP∗ M5∗ is a minimum weight
vertex cover in the vertex weighted graph HP M5∗ . Let DP M5 be set computed by
Algorithm 7 and P M5 be the associated ordered set. Now
≤ 2.
The last inequality follows from the fact that CP M5∗ is a two-factor approximate
weighted vertex cover in the graph HP M5∗ .
2250188-19
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Algorithm 8: Deletion-type-7(G).
Input: G = (V, E) such that there exists a vertex set S with G[V \S] ∈ F7
Output: S7 ⊆ V such that G[V \S7 ] ∈ F7
S7 = ∅; temp = n;
for each ordered set J6 =< a1 , a2 , a3 , b1 , b2 , b3 > do
Construct the vertex weighted graph HJ6 associated with J6 ;
Compute two-factor vertex cover CJ6 in the graph HJ6 ;
Construct the set SJ6 = TJ6 ∪ CJ6 ;
if |SJ6 | < temp then
S7 = SJ 6 ;
temp = |S7 |;
end
end
Return S7 ;
2250188-20
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
Next, we claim that G[V \SJ6 ] ∈ F7 . We define the sets Xi = X̂i \CJ6 , for
i = 1, 2, 3 and Yi = Ŷi \CJ6 , for i = 1, 2, 3. Since the vertices in J6 are assigned with
a larger weight these vertices are not in the vertex cover CJ6 . As a result of which
xi ∈ Xi and yi ∈ Yi , for i = 1, 2, 3. Since CJ6 contains at least one end vertices of
the edges in E1 , the sets X1 , X2 , X3 , Y1 , Y2 , Y3 are independent sets. Inclusion of the
edge set E2 in HJ6 implies that the sets X1 ∪ Y1 , X2 ∪ Y2 and X3 ∪ Y3 are indepen-
dent sets. At the same time, inclusion of the edge set E3 implies that the induced
subgraphs G[X1 ∪ X2 ], G[X2 ∪ X3 ], G[X1 ∪ X3 ], G[Y1 ∪ Y2 ], G[Y2 ∪ Y3 ], G[Y1 ∪ Y3 ],
G[X1 ∪ Y2 ], G[X2 ∪ Y3 ] and G[X3 ∪ Y1 ] are bicliques. Now, if there exists a vertex
x1 ∈ X1 such that it is adjacent to all the vertices in Y3 , then we exclude x1 from
X1 and include it in Y1 . After shifting all such vertices from X1 to Y1 , we will
denote the resulting vertex sets as X1 and Y1 . Similarly, we construct the vertex
sets X2 , Y2 , X3 , Y3 . Now, it is easy to verify that G[{ 3i=1 Xi } ∪ { 3i=1 Yi }] ∈ F6 .
Lemma 3.14. Let G be a graph such that it has a minimum size 3-dominator
partization set S7∗ with G[V \S7∗ ] ∈ F7 . Then S7 = Deletion-type-7(G) is a two-
factor approximate solution.
≤ 2.
The last inequality follows from the fact that CJ6∗ is a two-factor approximate
weighted vertex cover in the graph HJ6∗ .
2250188-21
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
4. Conclusion
We proved that Min-2-D-Partz is approximable with a factor of two
and it is the best possible approximation factor. Given a graph G, in
Max-2-Dominator-Partization it is required to find a vertex set S of maxi-
mum size such that G[S] is a 2-dominator-colorable graph. It can be shown that
Max-2-Dominator-Partization is equivalent to Maximum Independent Set and
cannot be approximable within a factor better than O(n1−ε ), for any ε > 0, unless
P = NP, because Maximum Independent Set has such a lower bound [15]. We also
prove that Min-3-D-Partz is equivalent to Min-OCT and is approximable within a
√
factor of O( log n). We expect that Min-3-D-Partz cannot be approximable within
a factor better than O(n1−ε ), for any ε > 0, unless P = NP.
2250188-22
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
References
√
[1] A. Agarwal, M. Charikar, K. Makaryche and Y. Makarychev, O( log n) approxi-
mation algorithms for min uncut, min 2cnf deletion, and directed cut problems, in
Proc. 37th Annual ACM Symp. Theory of Computing (Baltimore, MD, USA, 2005),
pp. 573–581.
[2] S. Arumugam, K. R. Chandrasekar, N. Misra, G. Philip and S. Saurabh, Algorith-
mic aspects of dominator colorings in graphs, in Int. Workshop on Combinatorial
Algorithms (Springer, 2011), pp. 19–30.
[3] M. Chellali and F. Maffray, Dominator colorings in some classes of graphs, Graphs
Combin. 28(1) (2012) 97–107.
[4] Y. H. Chen, The dominated coloring problem and its application, in Int. Conf. Com-
putational Science and its Applications (Springer, 2014), pp. 132–145.
[5] M. Chlebı́k and J. Chlebı́ková, On approximation hardness of the minimum 2sat-
deletion problem, in Int. Symp. Mathematical Foundations of Computer Science
(Springer, 2004), pp. 263–273.
[6] V. Chvatal, A greedy heuristic for the set-covering problem, Math. Operations Res.
4(3) (1979) 233–235.
[7] S. Das, Complexities of vertex coloring problems with some domination properties,
PhD thesis, Indian Institute of Technology Madras (2021).
[8] S. Das and S. Mishra, Lower bounds on approximating some variations of vertex
coloring problem over restricted graph classes, Discrete Math. Algorithms Appl. 12(6)
(2020) 2050086.
[9] S. Das and S. Mishra, On the complexity of minimum q-domination partization prob-
lems, J. Combin. Opt. 43(2) (2022) 363–383.
[10] I. Dinur and D. Steurer, Analytical approach to parallel repetition, in Proc. 46th
Annual ACM Symp. Theory of Computing (New York, United States, 2014), pp. 624–
633.
[11] F. Gavril and M. Yannakakis, Independent unpublished work mentioned in Com-
binatorial Optimization: Algorithms and Complexity, C. H. Papadimitriou and K.
Steiglitz, (Courier Corporation, 2001), p. 432.
[12] R. Gera, On dominator colorings in graphs, Graph Theory Notes New York 52 (2007)
25–30.
[13] R. Gera, On the dominator colorings in bipartite graphs, in 4th Int. Conf. Information
Technology (IEEE, 2007), pp. 947–952.
[14] R. Gera, C. W. Rasmussen and S. Horton, Dominator colorings and safe clique par-
titions, Congress 181 (2006) 19–32.
[15] J. Håstad, Clique is hard to approximate within n1−ε , Acta Math. 182(1) (1999)
627–636.
[16] D. S. Hochbaum, Approximating clique and biclique problems, J. Algorithms 29(1)
(1998) 174–200.
[17] S. Khot, On the power of unique 2-prover 1-round games, in Proc.34th Annual ACM
Symp. Theory of Computing (Montreal Quebec, Canada, 2002), pp. 767–775.
[18] S. Khot and O. Regev, Vertex cover might be hard to approximate to within 2 − ,
J. Comput. Syst. Sci. 74(3) (2008) 335–349.
[19] R. Krithika, A. Rai, S. Saurabh and P. Tale, Parameterized and exact algorithms for
class domination coloring, in Int. Conf. Current Trends in Theory and Practice of
Informatics (Springer, 2017), pp. 336–349.
[20] C. Lund and M. Yannakakis, On the hardness of approximating minimization prob-
lems, J. ACM 41 (1994) 960–981.
2250188-23
July 31, 2023 11:18 WSPC/S1793-8309 257-DMAA 2250188
2250188-24