On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

Goyal, Prachi; Kamat, Vikram; Misra, Neeldhara

doi:10.1007/978-3-642-40313-2_44

Cited by 3 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Approximation bounds for the matching based algorithm when the input graph has certain degree constraints were reported in [23]. A fixed-parameter tractable algorithm was reported for the case q = 2 in [10].…”

Section: Introductionmentioning

confidence: 99%

Improved approximation for maximum edge colouring problem

Chandran

Lahiri

Singh

2022

Discrete Applied Mathematics

View full text Add to dashboard Cite

The anti-Ramsey number, ar (G, H) is the minimum integer k such that in any edge colouring of G with k colours there is a rainbow subgraph isomorphic to H, namely, a copy of H with each of its edges assigned a different colour. The notion was introduced by Erdös and Simonovits in 1973. Since then the parameter has been studied extensively. The case when H is a star graph was considered by several graph theorists from the combinatorial point of view. Recently this case received the attention of researchers from the algorithm community because of its applications in interface modelling of wireless networks. To the algorithm community, the problem is known as maximum edge q-colouring problem: Find a colouring of the edges of G, maximizing the number of colours satisfying the constraint that each vertex spans at most q colours on its incident edges. It is easy to see that the maximum value of the above optimization problem equals ar(G, K 1,q+1 ) − 1.In this paper, we study the maximum edge 2-colouring problem from the approximation algorithm point of view. The case q = 2 is particularly interesting due to its application in real-life problems. Algorithmically, this problem is known to be NP-hard for q ≥ 2. For the case of q = 2, it is also known that no polynomial-time algorithm can approximate to a factor less than 3/2 assuming the unique games conjecture. Feng et al. showed a 2-approximation algorithm for this problem. Later Adamaszek and Popa presented a 5/3-approximation algorithm with the additional assumption that the input graph has a perfect matching. Note that the obvious but the only known algorithm issues different colours to the edges of a maximum matching (say M) and different colours to the connected components of G \ M. In this article, we give a new analysis of the aforementioned algorithm to show that for triangle-free graphs with perfect matching the approximation ratio is 8/5. We also show that this algorithm cannot achieve a factor better than 58/37 on triangle free graphs that has a perfect matching. The contribution of the paper is a completely new, deeper and closer analysis of how the optimum achieves a higher number of colours than the matching based algorithm, mentioned above.

show abstract

Section: Introductionmentioning

confidence: 99%

Improved approximation for maximum edge colouring problem

Chandran

Lahiri

Singh

2022

Discrete Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…Approximation bounds for the matching based algorithm when the input graph has certain degree constraints were reported in [CMRS18]. A fixed-parameter tractable algorithm was reported for the case q = 2 in [GKM13].…”

Section: Introductionmentioning

confidence: 99%

Improved Approximation for Maximum Edge Colouring Problem

Chandran¹,

Lahiri²,

Singh³

2019

Preprint

View full text Add to dashboard Cite

The anti-Ramsey number, ar(G, H) is the minimum integer k such that in any edge colouring of G with k colours there is a rainbow subgraph isomorphic to H, namely, a copy of H with each of its edges assigned a different colour. The notion was introduced by Erdös and Simonovits in 1973. Since then the parameter has been studied extensively. The case when H is a star graph was considered by several graph theorists from the combinatorial point of view. Recently this case received the attention of researchers from the algorithm community because of its applications in interface modelling of wireless networks. To the algorithm community, the problem is known as maximum edge q-colouring problem: Find a coloring of the edges of G, maximizing the number of colors satisfying the constraint that each vertex spans at most q colors on its incident edges. It is easy to see that the maximum value of the above optimization problem equals ar(G, K 1,q+1 ) − 1.In this paper we study the maximum edge 2-coloring problem from the approximation algorithm point of view. The case q = 2 is particularly interesting due to its application in real life problems. Algorithmically, this problem is known to be NP-hard for q ≥ 2. For the case of q = 2, it is also known that no polynomial time algorithm can approximate to a factor less than 3/2 assuming the unique games conjecture. Feng et al. showed a 2-approximation algorithm for this problem. Later Adamaszek and Popa presented a 5/3approximation algorithm with the additional assumption that the input graph has a perfect matching. Note that the obvious but the only known algorithm issues different colours to the edges of a maximum matching (say M ) and different colours to the connected components of G \ M . In this article, we give a new analysis of the aforementioned algorithm leading to an improved approximation bound for triangle-free graphs with perfect matching. We also show a new lower bound when the input graph is triangle-free. The contribution of the paper is a completely new, deeper and closer analysis of how the optimum achieves higher number of colors than the matching based algorithm, mentioned above.

show abstract

Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor

Dvořák,

Lahiri

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem

Cited by 3 publications

References 18 publications

Improved approximation for maximum edge colouring problem

Improved approximation for maximum edge colouring problem

Improved Approximation for Maximum Edge Colouring Problem

Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor

Contact Info

Product

Resources

About