[PDF] Top 20 Approximating the max edge-coloring problem
Has 10000 "Approximating the max edge-coloring problem" found on our website. Below are the top 20 most common "Approximating the max edge-coloring problem".
Approximating the max edge-coloring problem
... of the classical vertex-coloring problem which is known as Max (Vertex-)Coloring (MVC) problem, [3, ...4]. The MEC problem arises in switch based communication ... Voir le document complet
22
On the max-weight edge coloring problem
... This problem can be formulated in graph-theoretic terms as following: senders and receivers can be considered as the vertices V of a weighted graph G = (V, E), whose edges E correspond to messages and their ... Voir le document complet
16
Improved Approximation Algorithms for the Max-Edge Coloring Problem
... Concerning the approximability of the MEC problem, a natural greedy 2- approximation algorithm for general graphs has been proposed in ...attains the 7/6 inap- proximability bound has been ... Voir le document complet
12
Approximating min-max (regret) versions of some polynomial problems
... Introduction The definition of an instance of a combinatorial optimization problem requires to specify parameters, in particular objective function coefficients, which may be uncertain or ...through ... Voir le document complet
10
On some applications of the selective graph coloring problem
... which the vertices correspond to TRXs and there is an edge between two vertices if the corresponding TRXs are too close so that inter- ferences may ...of the interference ...is the ... Voir le document complet
8
On a generalized graph coloring/batch scheduling problem
... = max{w(e)|e ∈ M i }, such that w(M ) = P s i=1 w(M i ) is ...In the version we study in this paper preemptions are not allowed. In the following we shall refer to this problem as Batch ... Voir le document complet
8
Complexity and algorithms for injective edge-coloring in graphs
... to the edges of G such that any two edges each incident with one distinct endpoint of a third edge, receive distinct ...colors. The problem of determining whether such a k-coloring ... Voir le document complet
13
Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier
... in the literature. In our work, we focus on the average degree density which is defined as the ratio between the number of edges and the number of nodes in a graph ...of the ... Voir le document complet
12
Efficient algorithms for the Max k-Vertex Cover problem
... is the neighborhood of ...as edge (j, l) is already covered by ...on the measure-and-conquer paradigm (see for instance ...to the classical branch-and-reduce paradigm where for each level of ... Voir le document complet
14
A new efficient RLF-like algorithm for the vertex coloring problem
... for approximating χ(G) has an approximation ratio of O(n(log log n) 2 /(log n) 3 ) [10], where n is the number of vertices in ...for the VCP generally produce colorings with much less colors, but ... Voir le document complet
17
Approximating MAX SAT by Moderately Exponential and Parameterized Algorithms
... evaluate the complexity of Algorithm 1 , we count the number of leaves in the ...if the number of leaves is T ( n ) , then the algorithm obviously works in time O ∗ ( T ( n )) ...In ... Voir le document complet
11
Addressing the Problem of Finding a Single Vital Edge in a Maximum Flow Graph
... Fig-9. The idea is to collapse paths p 1 = {e 1 , e 3 } and p 2 = {e 2 , e 4 } between nodes u and v because they all have the same flow and so none of the edges will be a unique vital ...if ... Voir le document complet
7
The Parallel Complexity of Coloring Games
... graphs, the above-mentioned algorithm has O(m + n √ n)-time complexity and O(n + m)-space ...when the graph gets larger, potential applications of coloring games as a computational mechanism design ... Voir le document complet
13
Hardness of Approximating the Traffic Grooming Problem
... in the independent set graph for every triangle in the original graph, and there is an edge in the independent set graph if the two corresponding triangles have at least one edge ... Voir le document complet
5
The Max Quasi-Independent Set Problem
... essentially the same problem as γ-QIS is addressed, formulated as the research, given a graph and 0 ≤ γ ≤ 1, of a maximum subgraph of sparsity (defined as the ratio of the number of its ... Voir le document complet
21
Approximating MAX SAT by moderately exponential algorithms
... in the field of polynomial time approximation as well as in the field of parameterized and exact solution by exponential time algorithms (see Section ...for max sat with running times which, though ... Voir le document complet
16
Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem
... to the one in the previous paragraph, it is not ...words, the complement of G X 1 is formed by some non-overlapping ...Finding the minimum entropy coloring of this graph is trivial and ... Voir le document complet
6
Coloring of the infinite grid
... Axenovich, On multiple coverings of the infinite rectangular grid with balls of constant radius, Discrete Mathematics, 268 (2003), 31–48.. [2] S[r] ... Voir le document complet
1
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
... algorithms. The related k-edge-connected subgraph problem and its associated polytope have also been the subject of extensive research in the past ...study the ... Voir le document complet
30
On the Combinatorial Complexity of Approximating Polytopes
... points. The approximation P is defined as the convex hull of ...of the witness-collector approach [ 17 ] to show that P has low combinatorial ... Voir le document complet
22
Sujets connexes