On the Complexity of the Max-Edge-Coloring Problem with Its Variant
نویسنده
چکیده
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, ..., Ez} of a weighted graph G=(V, E) to minimize { } ∑ = ∈ z i i k k E e e w 1 ) ( max , where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the new graph problem and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs. Next, we show the splitting chromatic max-edge-coloring problem, a variant of MECP, is NP-complete even when the input graph is restricted to biplanar graphs. Finally, we also show that these two problems have applications in scheduling data redistribution on parallel computer systems.
منابع مشابه
On the Complexity of the Max-Edge-Coloring Problem with Its Variants
The max-edge-coloring problem (MECP) is finding an edge colorings {E1, E2, E3, ..., Ez} of a weighted graph G=(V, E) to minimize { } ∑ = ∈ z i i k k E e e w 1 ) ( max , where w(ek) is the weight of ek. In the work, we discuss the complexity issues on the MECP and its variants. Specifically, we design a 2-approximmation algorithm for the max-edge-coloring problem on biplanar graphs, which is bip...
متن کاملThe Complexity of (List) Edge-Coloring Reconfiguration Problem
Let G be a graph such that each edge has its list of available colors, and assume that each list is a subset of the common set consisting of k colors. Suppose that we are given two list edge-colorings f0 and fr of G, and asked whether there exists a sequence of list edge-colorings of G between f0 and fr such that each list edge-coloring can be obtained from the previous one by changing a color ...
متن کاملApproximating the Max Edge-Coloring Problem
The max edge-coloring problem is a natural weighted generalization of the classical edge-coloring problem arising in the domain of communication systems. In this problem each color class is assigned the weight of the heaviest edge in this class and the objective is to find a proper edge-coloring of the input graph minimizing the sum of all color classes’ weights. We present new approximation re...
متن کاملOn the max-weight edge coloring problem
We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal to the maximum weight of its edges, so that the total weight of the partition is minimized. We explore the frontier between polynomial and NP-hard variants of the problem as well as the approximability of the NP-har...
متن کاملBounded Max-colorings of Graphs
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most b and of weight equal to the weight of the heaviest vertex/edge in this class. The bounded max-vertex/edge-coloring problems ask for such a coloring minimizing the sum of all color classes’ weights. In this paper we present complexity results and approximation algorithms for those problems on g...
متن کامل