Search references for SET COVER-PROBLEM. Phrases containing SET COVER-PROBLEM
See searches and references containing SET COVER-PROBLEM!SET COVER-PROBLEM
Classical problem in combinatorics
The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. Given a set of elements
Set_cover_problem
Partition into subsets from a given family
relation between a set of choices and a set of constraints. For example, an exact cover problem is equivalent to an exact hitting set problem, an incidence
Exact_cover
Subset of a graph's vertices, including at least one endpoint of every edge
the graph. In computer science, the problem of finding a minimum vertex cover is a classical optimization problem. It is NP-hard, so it cannot be solved
Vertex_cover
The geometric set cover problem is the special case of the set cover problem in geometric settings. The input is a range space Σ = ( X , R ) {\displaystyle
Geometric_set_cover_problem
Problem in computer science
1 / e − o ( 1 ) {\displaystyle 1-1/e-o(1)} . Set cover problem is to cover all elements with as few sets as possible. G. L. Nemhauser, L. A. Wolsey and
Maximum_coverage_problem
Subset of a graph's nodes such that all other nodes link to at least one
between the two problems. This proved the dominating set problem to be NP-complete as well. The set cover problem is a well-known NP-hard problem – the decision
Dominating_set
Problem in computer science
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
Set_packing
Type of computational problem
covering problems are the set cover problem, which is equivalent to the hitting set problem, and its special cases, the vertex cover problem and the edge
Covering_problems
Subsets whose union equals the whole set
Mathematical structure Partition of a set – Mathematical ways to group elements of a set Set cover problem – Classical problem in combinatorics Star refinement
Cover_(topology)
set cover problem. Fix any instance ⟨c,𝒮⟩ of set cover over a universe 𝒰. For step 1, let IP be the standard integer linear program for set cover for
Randomized_rounding
Unrelated vertices in graphs
α(G). The optimization problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As such, it is unlikely
Independent set (graph theory)
Independent_set_(graph_theory)
Subset of a graph's edges
cover problem is the problem of finding an edge cover of minimum size. It is an optimization problem that belongs to the class of covering problems and
Edge_cover
Set of hypergraph nodes to which every hyperedge is connected
algorithm for hitting set that runs in time d OPTnO(1). The hitting set problem is equivalent to the set cover problem: An instance of set cover can be viewed
Vertex_cover_in_hypergraphs
Optimization problem
The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet
Vehicle_routing_problem
Concept in integral mathematics
program. Consider the set cover problem, the linear programming relaxation of which was first considered by Lovász in 1975. In this problem, one is given as
Linear_programming_relaxation
Area of discrete mathematics
case of set cover problem where sets are the closed neighborhoods. Vertex cover problem is the special case of set cover problem where sets to cover are every
Graph_theory
Data structure for integer priorities
or are already sorted, and greedy approximation algorithms for the set cover problem. The quantized version of the structure has also been applied to scheduling
Bucket_queue
Subfield of mathematical optimization
finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are
Combinatorial_optimization
Mathematical problem
and then reducing the problem to a set cover problem. As Valtr (1998) showed, the set system derived from an art gallery problem has bounded VC dimension
Art_gallery_problem
Method to solve optimization problems
set problem, and the matching problem are packing LPs. The LP relaxations of the set cover problem, the vertex cover problem, and the dominating set problem
Linear_programming
On short connecting nets with added points
While Steiner tree problems may be formulated in a number of settings, they all require an optimal interconnect for a given set of objects and a predefined
Steiner_tree_problem
Set of computational problems stated by Richard Karp (1973)
optimization) Clique (see also independent set problem) Set packing Vertex cover Set covering Feedback node set Feedback arc set Directed Hamilton circuit (Karp's
Karp's 21 NP-complete problems
Karp's_21_NP-complete_problems
Borsuk's problem on upper and lower bounds for the number of smaller-diameter subsets needed to cover a bounded n-dimensional set. The covering problem of Rado:
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Topics referred to by the same term
professional certification program by Sun Microsystems Set cover problem, a classical problem in computer science and complexity theory Save Cursor Position
SCP
Edges that hit all cycles in a graph
vertex cover problem, could be transformed ("reduced") into equivalent inputs to the feedback arc set decision problem. Some NP-complete problems can become
Feedback_arc_set
Partition of a graph's nodes into cliques
the vertices of G is a clique cover of G if and only if it is a coloring of the complement of G. The clique cover problem in computational complexity theory
Clique_cover
Mathematical problem involving optimal stopping theory
known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem. Its solution is also
Secretary_problem
Conjecture in computational complexity theory
two real numbers c>s, the (c,s)-gap label-cover problem with unique constraints is the following promise problem (Lyes,Lno): Lyes={G:value(G)≥c}, Lno={G:value(G)≤s}
Unique_games_conjecture
Topologically invariant definition of the dimension of a space
n-dimensional "at every scale". Carathéodory's extension theorem Geometric set cover problem Metacompact space Point-finite collection Lebesgue, Henri (1921).
Lebesgue_covering_dimension
Optimization by removing non-optimal solutions to subproblems
0/1 knapsack problem Set cover problem Feature selection in machine learning Structured prediction in computer vision Arc routing problem, including the
Branch_and_bound
Problems which attempt to find the most efficient way to pack objects into containers
are required to completely cover every region of the container, where objects are allowed to overlap. In a bin packing problem, people are given: A container
Packing_problems
Graph data structure
constant-factor approximation algorithm for this problem, which can be shown by reduction from the set cover problem. However, for graphs with bounded treewidth
E-graph
Unsolved geometry problem
universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set of diameter one
Lebesgue's universal covering problem
Lebesgue's_universal_covering_problem
Set of edges without common vertices
cover. Via this result, the minimum vertex cover, maximum independent set, and maximum vertex biclique problems may be solved in polynomial time for bipartite
Matching_(graph_theory)
Mathematical and computational problem
The bin packing problem is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of
Bin_packing_problem
listing all minimal hitting sets of a family of sets, or of listing all minimal set covers of a family of sets. These problems can be solved in quasi-polynomial
Monotone_dualization
Estimate of time taken for running an algorithm
NP-complete problems do not have quasi-polynomial time algorithms. For example, see the known inapproximability results for the set cover problem. The term
Time_complexity
satisfiability problem Conjunctive Boolean query Cyclic ordering Exact cover problem. Remains NP-complete for 3-sets. Solvable in polynomial time for 2-sets (this
List_of_NP-complete_problems
Problem in combinatorial optimization
The knapsack problem is the following problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine which items
Knapsack_problem
Subdivision into few independent sets
independent sets as possible. An example is the problem of computing the arboricity of an undirected graph, the minimum number of forests needed to cover all
Matroid_partitioning
Optimization algorithm
assignment problem (GAP) Frequency assignment problem (FAP) Redundancy allocation problem (RAP) Set cover problem (SCP) Partition problem (SPP) Weight
Ant colony optimization algorithms
Ant_colony_optimization_algorithms
Optimization problem
minisum facility location problem on general graphs is NP-hard to solve optimally, by reduction from (for example) the set cover problem. A number of approximation
Optimal_facility_location
Form of computing using molecular biology
NP-complete problems. Specifically, the hamiltonian path problem (HPP) and some versions of the set cover problem are a few NP-complete problems which have
Peptide_computing
Set of paths in a directed graph
G = (V, E), a path cover is a set of directed paths such that every vertex v ∈ V belongs to at least one path. Note that a path cover may include paths
Path_cover
In mathematics, a vertex cycle cover (commonly called simply cycle cover) of a graph G is a set of cycles which are subgraphs of G and contain all vertices
Vertex_cycle_cover
Size of biclique cover of a graph
QUESTION: Does G admit a biclique edge cover containing at most k bicliques? This problem appears as problem GT18 in Garey and Johnson's classical book
Bipartite_dimension
Set of primitive shapes whose union equals a polygon
polygon. A polygon covering problem is a special case of the set cover problem. In general, the problem of finding a smallest set covering is NP-complete
Polygon_covering
Unsolved geometry problem about planar regions
Unsolved problem in mathematics What is the minimum area of a shape that can cover every unit-length curve? More unsolved problems in mathematics Moser's
Moser's_worm_problem
Seven mathematical problems with a US$1 million prize for each solution
prize in 2010 was widely covered in the media. In 2026, OpenAI claimed to resolve the Navier–Stokes existence and smoothness problem using an internal AI
Millennium_Prize_Problems
NP-hard problem in combinatorial optimization
art. Canadian traveller problem Exact algorithm Route inspection problem (also known as "Chinese postman problem") Set TSP problem Seven Bridges of Königsberg
Travelling_salesman_problem
Complexity class
Vertex cover problem Independent set problem Dominating set problem Graph coloring problem Sudoku To the right is a diagram of some of the problems and the
NP-completeness
Largest independent set of paired elements
combinatorial optimization, the matroid parity problem is a problem of finding the largest independent set of paired elements in a matroid, a structure
Matroid_parity_problem
Standard form of Boolean function
sum from a Blake canonical form amounts in general to solving the set cover problem, so is NP-hard. Archie Blake presented his canonical form at a meeting
Blake_canonical_form
Independent set which is not a subset of any other independent set
independent set. The graphs in which all maximal independent sets have the same size are called well-covered graphs. The phrase "maximal independent set" is also
Maximal_independent_set
Vertices whose removal breaks all cycles
vertex set number of a graph is the size of a smallest FVS. Whether there exists a feedback vertex set of size at most k is an NP-complete problem; it was
Feedback_vertex_set
Problem in probability theory
probability of getting any coupon in the set of coupons J. Cover time – a generalization of the coupon collector's problem to Markov chains and random walks
Coupon_collector's_problem
Branch of mathematics that studies sets
have made set theory an area of major interest for logicians and philosophers of mathematics. Contemporary research into set theory covers a vast array
Set_theory
Algorithm for the minimization of Boolean functions
Step two of the algorithm amounts to solving the set cover problem; NP-hard instances of this problem may occur in this algorithm step. In this example
Quine–McCluskey_algorithm
Question about single-shape aperiodic tiling
discrete geometry, the einstein problem asks about the existence of a single prototile that by itself forms an aperiodic set of prototiles; that is, a shape
Einstein_problem
1945 book on problem solving by George Pólya
suggestions (and these are covered in more detail in the book's heuristics dictionary) are: Guess and test Solve a related but simpler problem Use symmetry, i.e
How_to_Solve_It
Eight disciplines of team-oriented problem solving method
recurring problems. It establishes a permanent corrective action based on statistical analysis of the problem and on the origin of the problem by determining
Eight disciplines problem solving
Eight_disciplines_problem_solving
Computational problem in graph theory
maximum flow problems involve finding a feasible flow through a flow network that obtains the maximum possible flow rate. The maximum flow problem can be seen
Maximum_flow_problem
Czech-Canadian mathematician
element of one of the sets and keeping all sets containing that element. In 1979, he studied a weighted version of the set cover problem, and proved that a
Václav_Chvátal
Collection of subsets covering all t-element subsets
(A066225) Block design Combinatorial design Covering code Finite geometry Set cover problem Steiner system Gordon, Daniel M.; Kuperberg, Greg; Patashnik, Oren
Covering_design
Points with no three in a line
cap set problem is the problem of finding the size of the largest possible cap set, as a function of n {\displaystyle n} . The first few cap set sizes
Cap_set
On bipartite matching and vertex cover
describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently
Kőnig's theorem (graph theory)
Kőnig's_theorem_(graph_theory)
Finding shortest walks through all graph edges
circuit (a closed walk that covers every edge once), that circuit is an optimal solution. Otherwise, the optimization problem is to find the smallest number
Chinese_postman_problem
Mathematical concept
multi-objective optimization problem is ming(f1(x),…,fk(x),θ)s.t.x∈Xθ where θ is a vector parameter, the set Xθ⊆X is a set depending on the parameter θ
Multi-objective_optimization
Class of mathematical problems
the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an
Optimal_stopping
Comprehensive list of Magic: The Gathering card sets since its inception in 1993
those two sets each have seven more cards than Alpha did. ^II: When the Revised Edition was in production in 1994, a number of problems with the set became
List of Magic: The Gathering sets
List_of_Magic:_The_Gathering_sets
Method of DNA sequence reconstruction
sequence assemblers Sequence alignment De novo transcriptome assembly Set cover problem List of sequenced animal genomes Plant genome assembly Sohn JI, Nam
Sequence_assembly
Number of vertices with unambiguous distances
set cover problem, a problem of covering all of a given collection of elements by as few sets as possible in a given family of sets. In the set cover
Metric dimension (graph theory)
Metric_dimension_(graph_theory)
1979 conjecture in combinatorics
Unsolved problem in mathematics If any two sets in some finite family of sets have a union that also belongs to the family, must some element belong to
Union-closed_sets_conjecture
Computer-based method for summarizing a text
summary to cover all important and relevant concepts in the document. This is an instance of set cover. Similarly, the facility location problem is a special
Automatic_summarization
reformulate the problem as an instance of weighted set cover in such a way that the weight of the optimal solution to the set cover instance is less
Shortest_common_supersequence
Series of children's books
Beyond the Spiderwick Chronicles, includes The Nixie's Song (2007), A Giant Problem (2008), and The Wyrm King (2009). A feature film adaptation, also titled
The_Spiderwick_Chronicles
of problems where learning augmented algorithms have been applied are the following. The ski rental problem The weighted paging problem The set cover problem
Learning_augmented_algorithm
Family of graphs whose shallow minors are sparse graphs
schemes for the set cover problem, maximum independent set problem, dominating set problem, and several other related graph optimization problems. Nešetřil
Bounded_expansion
23 mathematical problems stated in 1900
Hilbert's problems are 23 problems in mathematics published by German mathematician David Hilbert in 1900. He intended to rival the master of French mathematics
Hilbert's_problems
Unproven computational hardness assumption
algorithm for edge clique cover must have double exponential dependence on the parameter. In the three-party set disjointness problem in communication complexity
Exponential_time_hypothesis
American computer scientist
NP-complete by reducing it to a set cover problem. In his dissertation, he proved that the greedy method for set cover has a lower bound of 1 - 1/e ~ 63%
Gregory_Piatetsky-Shapiro
satisfiability problem Subset sum problem 3SUM Traveling salesman problem Vertex cover problem One-way function Set cover problem Independent set problem Probabilistic
List of computability and complexity topics
List_of_computability_and_complexity_topics
Mathematical set that can be enumerated
mathematical set is countable if either it is finite or it can be put in one to one correspondence with the set of natural numbers. Equivalently, a set is countable
Countable_set
Complexity class of approximable problems
token reconfiguration problem, via L-reduction from set cover. PTAS (polynomial time approximation scheme) consists of problems that can be approximated
APX
n−43 Branching process Independent set Graph coloring Covering number Set packing Ramsey's theorem Set cover problem Sphere packing Steiner system Matching
Packing_in_a_hypergraph
Algorithm for searching a problem space
problems. To cite some of them: graph partitioning, multidimensional knapsack, travelling salesman problem, quadratic assignment problem, set cover problem
Memetic_algorithm
Short story
"The Problem of the Covered Bridge" (1974) is a mystery short story by Edward D. Hoch which was first published in Ellery Queen's Mystery Magazine (Dec
The Problem of the Covered Bridge
The_Problem_of_the_Covered_Bridge
reduction from the minimum set cover problem. There is an algorithm that computes the nucleolus in time O(n3|B|), where B is the set of relevant coalitions
Minimum-cost spanning tree game
Minimum-cost_spanning_tree_game
Paradox in set theory
paradox in Frege's 1879 Begriffsschrift and framed the problem in terms of both logic and set theory, and in particular in terms of Frege's definition
Russell's_paradox
Unsolved problem in discrete geometry
Unsolved problem in mathematics What is the smallest real number r(n) such that n disks of radius r(n) can be arranged in such a way as to cover the unit
Disk_covering_problem
Shape that blocks all lines of sight
opaque set for the square, and for most other shapes this problem similarly remains unsolved. The shortest opaque set for any bounded convex set in the
Opaque_set
Mathematical problem
showing that any cover of the plane by five congruent closed sets contains a unit distance in one of the sets, and he also mentioned the problem in a later
Hadwiger–Nelson_problem
Fractal named after mathematician Benoit Mandelbrot
computing the Mandelbrot set. The cover was created by Peitgen, Richter and Saupe at the University of Bremen. The Mandelbrot set became prominent in the
Mandelbrot_set
Task of computing complete subgraphs
In computer science, the clique problem is the computational problem of finding cliques (subsets of vertices, all adjacent to each other, also called complete
Clique_problem
Class of algorithms that find approximate solutions to optimization problems
approximation algorithm is one for the minimum vertex cover problem, where the goal is to choose the smallest set of vertices such that every edge in the input
Approximation_algorithm
Form of active learning
English) is a form of active learning that starts by posing questions, problems or scenarios. It contrasts with traditional education, which generally
Inquiry-based_learning
American singer-songwriter (born 1961)
band called The Negro Problem. (Stew himself is Black.) In 1995 the band released a box set collection of singles including a cover of "MacArthur Park"
Stew_(musician)
Cycles in a graph that cover each edge twice
cycles. It is a problem posed in the 1970s by W. T. Tutte, Itai and Rodeh, George Szekeres and Paul Seymour and known as the cycle double cover conjecture
Cycle_double_cover
Edge case where the signalling of failure is ambiguous
called. The semipredicate problem is not universal among functions that can fail. If the range of a function does not cover the entire space corresponding
Semipredicate_problem
Process in geographic information systems
evidence to resolve toponyms. By means of mapping the problem to a conflict-free set cover problem, this model achieves a coherent and robust resolution
Toponym_resolution
travel, tourism, insurance
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
SET COVER-PROBLEM
travel, tourism, insurance