• Aucun résultat trouvé

Exact Algorithms for Dominating Clique Problems

N/A
N/A
Protected

Academic year: 2021

Partager "Exact Algorithms for Dominating Clique Problems"

Copied!
13
0
0

Texte intégral

Loading

Figure

Table 1: Results of Sections 2, 3 and 4.
Table 3: Running time of our algorithm vs. running time of exhaustive search for some values of λ.

Références

Documents relatifs

Wondering about the process of consolidation of coordination for the fight against desertification in the Tunisian South by the construction or reconstruction of trust is

Figure 1: Frequencies of descriptors selected for orange, by the subjects of GP1, as a function of the denomination correctness correct, wrong, or no answer when a subject does

Modificazioni genetiche delle piante di tabacco con riduzione significativa della concentrazione di trico- mi sulle foglie di tabacco, capaci di stoccare Pb-210 e

An exponential algorithm solves opti- maly an N P -hard optimization problem with a worst-case time, or space, complexity that can be established and, which is lower than the one of

Therefore, computing a feasible routing amounts to find a feasible solution to a Traveling Salesman Problem with Time Windows (TSPTW) [71], con- sidering the operator as a

Thus, it seems interesting to see if it is possible to compute solutions for the two optimization problems that guarantee a good approximation ratio with moderately exponential

Even if the work of [FH15] concerns a particular optimization problem (i.e., the quadratic minimum spanning tree problem), the approach is of general interest and has been applied

This bound is then used to remove some vertices from P after each branching step in the following way: select a vertex v and compute the upper bound using the matching algorithm for