Distributed Approximate k-Core Decomposition and Min-Max Edge Orientation: Breaking the Diameter Barrier

By applying iteratively Lemma 16, if there is a vertex of color R whose two consecutive vertices have distinct colors, then either G contains a net, or R is adjacent to exactly

De la même manière, érire un algorithme qui permet de maintenir l'eau entre deux températures.. données T min et

We presented an improved deterministic polynomial time approximation algo- rithm for the max-controlled set problem through the use of randomized rounding and

Recently, a strong version was given by Colding and Minicozzi [CMM08], where they found good approximating sweep-outs, such that “every curve in the sweepouts with length close to

In Section 6, we prove that the MEC problem is NP-complete even for complete graphs with bi-valued edge weights, and we give an asymptotic 4 3 -approximation algorithm for

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

Revisit Proposition 5 and remark that if m < (log 1.5874/ log 3)opt(G) ≈ 0.42opt(G), then the parameterized algorithm of Proposition 5 runs faster than that of Proposition 4

In this paper, we investigate the parameterized complexity of these two graph problems by consider- ing several parameters, such as the value p of the solution, k, the size τ of