approximable
1approximable — adjective Able to be approximated …
2Dominating set problem — The dominating set problem is an NP complete problem in graph theory.DefinitionAn instance of the dominating set problem consists of: * a graph G with a set V of vertices and a set E of edges, and * a positive integer K smaller than or equal to… …
3Probleme de l'ensemble dominant — Problème de l ensemble dominant Le problème d ensemble dominant est un problème NP complet de la théorie des graphes. Sommaire 1 Définition 2 Exemple 3 NP complétude 3.1 Preuve …
4Problème de l'ensemble dominant — Le problème d ensemble dominant est un problème NP complet de la théorie des graphes. Sommaire 1 Définition 2 Exemple 3 NP complétude 3.1 Preuve …
5Ensemble dominant — En théorie des graphes, un ensemble dominant d un graphe G = ( S, A ) est un sous ensemble D de l ensemble S des sommets tel que tout sommet qui n appartient pas à D possède au moins une arête commune avec un sommet de D. Le problème d ensemble… …
6Modulus of continuity — In mathematical analysis, a modulus of continuity is a function used to measure quantitatively the uniform continuity of functions. So, a function admits ω as a modulus of continuity if and only if for all x and y in the domain of f. Since moduli …
7A-group — In mathematics, in the area of abstract algebra known as group theory, an A group is a type of group that is similar to abelian groups. The groups were first studied in the 1940s by Philip Hall, and are still studied today. A great deal is known… …
8ALGORITHMIQUE — L’objet de l’algorithmique est la conception, l’évaluation et l’optimisation des méthodes de calcul en mathématiques et en informatique. Un algorithme consiste en la spécification d’un schéma de calcul, sous forme d’une suite d’opérations… …
9Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… …
10Vertex cover problem — In computer science, the vertex cover problem or node cover problem is an NP complete problem and was one of Karp s 21 NP complete problems. It is often used in complexity theory to prove NP hardness of more complicated problems. Definition A… …
