|
Set Packing
Set packing is a classical NP-complete problem in computational complexity theory and combinatorics, and was one of Karp's 21 NP-complete problems. Suppose one has a finite set ''S'' and a list of subsets of ''S''. Then, the set packing problem asks if some ''k'' subsets in the list are pairwise disjoint (in other words, no two of them share an element). More formally, given a universe \mathcal and a family \mathcal of subsets of \mathcal, a ''packing'' is a subfamily \mathcal\subseteq\mathcal of sets such that all sets in \mathcal are pairwise disjoint. The size of the packing is , \mathcal, . In the set packing decision problem, the input is a pair (\mathcal,\mathcal) and an integer k; the question is whether there is a set packing of size k or more. In the set packing optimization problem, the input is a pair (\mathcal,\mathcal), and the task is to find a set packing that uses the most sets. The problem is clearly in NP since, given ''k'' subsets, we can easily verify that the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NP-complete
In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # the problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. In this sense, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. If we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers to nondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm. Polynomial time refers to an amount of time that is considered "quick" for a det ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Constant-factor Approximation Algorithms
In computational complexity theory, the class APX (an abbreviation of "approximable") is the set of NP optimization problems that allow polynomial-time approximation algorithms with approximation ratio bounded by a constant (or constant-factor approximation algorithms for short). In simple terms, problems in this class have efficient algorithms that can find an answer within some fixed multiplicative factor of the optimal answer. An approximation algorithm is called an f(n)-approximation algorithm for input size n if it can be proven that the solution that the algorithm finds is at most a multiplicative factor of f(n) times worse than the optimal solution. Here, f(n) is called the ''approximation ratio''. Problems in APX are those with algorithms for which the approximation ratio f(n) is a constant c. The approximation ratio is conventionally stated greater than 1. In the case of minimization problems, f(n) is the found solution's score divided by the optimum solution's score, w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David S
David (; , "beloved one") (traditional spelling), , ''Dāwūd''; grc-koi, Δαυΐδ, Dauíd; la, Davidus, David; gez , ዳዊት, ''Dawit''; xcl, Դաւիթ, ''Dawitʿ''; cu, Давíдъ, ''Davidŭ''; possibly meaning "beloved one". was, according to the Hebrew Bible, the third king of the United Kingdom of Israel. In the Books of Samuel, he is described as a young shepherd and harpist who gains fame by slaying Goliath, a champion of the Philistines, in southern Canaan. David becomes a favourite of Saul, the first king of Israel; he also forges a notably close friendship with Jonathan, a son of Saul. However, under the paranoia that David is seeking to usurp the throne, Saul attempts to kill David, forcing the latter to go into hiding and effectively operate as a fugitive for several years. After Saul and Jonathan are both killed in battle against the Philistines, a 30-year-old David is anointed king over all of Israel and Judah. Following his rise to power, Da ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Michael R
Michael may refer to: People * Michael (given name), a given name * Michael (surname), including a list of people with the surname Michael Given name "Michael" * Michael (archangel), ''first'' of God's archangels in the Jewish, Christian and Islamic religions * Michael (bishop elect), English 13th-century Bishop of Hereford elect * Michael (Khoroshy) (1885–1977), cleric of the Ukrainian Orthodox Church of Canada * Michael Donnellan (1915–1985), Irish-born London fashion designer, often referred to simply as "Michael" * Michael (footballer, born 1982), Brazilian footballer * Michael (footballer, born 1983), Brazilian footballer * Michael (footballer, born 1993), Brazilian footballer * Michael (footballer, born February 1996), Brazilian footballer * Michael (footballer, born March 1996), Brazilian footballer * Michael (footballer, born 1999), Brazilian footballer Rulers =Byzantine emperors= * Michael I Rangabe (d. 844), married the daughter of Emperor Nikephoro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gerhard J
Gerhard is a name of Germanic origin and may refer to: Given name * Gerhard (bishop of Passau) (fl. 932–946), German prelate * Gerhard III, Count of Holstein-Rendsburg (1292–1340), German prince, regent of Denmark * Gerhard Barkhorn (1919–1983), German World War II flying ace * Gerhard Berger (born 1959), Austrian racing driver * Gerhard Boldt (1918–1981), German soldier and writer * Gerhard de Beer (born 1994), South African football player * Gerhard Diephuis (1817–1892), Dutch jurist * Gerhard Domagk (1895–1964), German pathologist and bacteriologist and Nobel Laureate * Gerhard Dorn (c.1530–1584), Flemish philosopher, translator, alchemist, physician and bibliophile * Gerhard Ertl (born 1936), German physicist and Nobel Laureate * Gerhard Fieseler (1896–1987), German World War I flying ace * Gerhard Flesch (1909–1948), German Nazi Gestapo and SS officer executed for war crimes * Gerhard Gentzen (1909–1945), German mathematician and logician * Gerhard ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Marek Karpinski
Marek Karpinski at the Hausdorff Center for Mathematics, Excellence Cluster is a and known for his research in the theory of s and their applications, , |
Clique Problem
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete subgraphs) in a graph. It has several different formulations depending on which cliques, and what information about the cliques, should be found. Common formulations of the clique problem include finding a maximum clique (a clique with the largest possible number of vertices), finding a maximum weight clique in a weighted graph, listing all maximal cliques (cliques that cannot be enlarged), and solving the decision problem of testing whether a graph contains a clique larger than a given size. The clique problem arises in the following real-world setting. Consider a social network, where the graph's vertices represent people, and the graph's edges represent mutual acquaintance. Then a clique represents a subset of people who all know each other, and algorithms for finding cliques can be used to discover these groups of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Singleton Set
In mathematics, a singleton, also known as a unit set or one-point set, is a set with exactly one element. For example, the set \ is a singleton whose single element is 0. Properties Within the framework of Zermelo–Fraenkel set theory, the axiom of regularity guarantees that no set is an element of itself. This implies that a singleton is necessarily distinct from the element it contains, thus 1 and are not the same thing, and the empty set is distinct from the set containing only the empty set. A set such as \ is a singleton as it contains a single element (which itself is a set, however, not a singleton). A set is a singleton if and only if its cardinality is . In von Neumann's set-theoretic construction of the natural numbers, the number 1 is ''defined'' as the singleton \. In axiomatic set theory, the existence of singletons is a consequence of the axiom of pairing: for any set ''A'', the axiom applied to ''A'' and ''A'' asserts the existence of \, which is the sam ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Exact Cover
In the mathematical field of combinatorics, given a collection of subsets of a set , an exact cover is a subcollection of such that each element in is contained in ''exactly one'' subset in . In other words, is a partition of consisting of subsets contained in . One says that each element in is covered by exactly one subset in . An exact cover is a kind of cover. In computer science, the exact cover problem is a decision problem to determine if an exact cover exists. The exact cover problem is NP-complete This book is a classic, developing the theory, then cataloguing ''many'' NP-Complete problems. and is one of Karp's 21 NP-complete problems. It is NP-complete even when each subset in contains exactly three elements; this restricted problem is known as exact cover by 3-sets, often abbreviated X3C. The exact cover problem is a kind of constraint satisfaction problem. An exact cover problem can be represented by an incidence matrix or a bipartite graph. Knuth's Algorith ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Set Cover Problem
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. It is one of Karp's 21 NP-complete problems shown to be NP-complete in 1972. Given a set of elements (called the universe) and a collection of sets whose union equals the universe, the set cover problem is to identify the smallest sub-collection of whose union equals the universe. For example, consider the universe and the collection of sets Clearly the union of is . However, we can cover all of the elements with the following, smaller number of sets: More formally, given a universe \mathcal and a family \mathcal of subsets of \mathcal, a ''cover'' is a subfamily \mathcal\subseteq\mathcal of sets whose union is \mathcal. In the set covering decision problem, the input is a pair (\mathcal,\mathcal) and an integer k; the question is whether there is a set covering of size k or less. In the set covering optimization problem, the input is a pair ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matching (graph Theory)
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. Finding a matching in a bipartite graph can be treated as a network flow problem. Definitions Given a graph a matching ''M'' in ''G'' is a set of pairwise non-adjacent edges, none of which are loops; that is, no two edges share common vertices. A vertex is matched (or saturated) if it is an endpoint of one of the edges in the matching. Otherwise the vertex is unmatched (or unsaturated). A maximal matching is a matching ''M'' of a graph ''G'' that is not a subset of any other matching. A matching ''M'' of a graph ''G'' is maximal if every edge in ''G'' has a non-empty intersection with at least one edge in ''M''. The following figure shows examples of maximal matchings (red) in three graphs. : A maximum matching (also known as maximum-cardinality matching) is a matching that contains the largest possible number of edges. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Claw-free Graph
In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph ''K''1,3 (that is, a star graph comprising three edges, three leaves, and a central vertex). A claw-free graph is a graph in which no induced subgraph is a claw; i.e., any subset of four vertices has other than only three edges connecting them in this pattern. Equivalently, a claw-free graph is a graph in which the neighborhood of any vertex is the complement of a triangle-free graph. Claw-free graphs were initially studied as a generalization of line graphs, and gained additional motivation through three key discoveries about them: the fact that all claw-free connected graphs of even order have perfect matchings, the discovery of polynomial time algorithms for finding maximum independent sets in claw-free graphs, and the characterization of claw-free perfect graphs., p. 88. They are the subject of hu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
