In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another...

many different polygon covering problems, depending on the type of polygon being covered. An example polygon covering problem is: given a rectilinear...

Museum guard problem Covering problems in graphs may refer to various set cover problems on subsets of vertices/subgraphs. Dominating set problem is the special...

In the bin covering problem, items of different sizes must be packed into a finite number of bins or containers, each of which must contain at least a...

cover problem can be formulated as the following integer linear program (ILP). This ILP belongs to the more general class of ILPs for covering problems. The...

cover problem. Benchmarks with Hidden Optimum Solutions for Set Covering, Set Packing and Winner Determination A compendium of NP optimization problems -...

overlap? More unsolved problems in mathematics The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares...

such a way as to cover the unit disk? More unsolved problems in mathematics The disk covering problem asks for the smallest real number r ( n ) {\displaystyle...

of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks...

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...

a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection...

Many mathematical problems have been stated but not yet solved. These problems come from many areas of mathematics, such as theoretical physics, computer...

Lebesgue's universal covering problem is an unsolved problem in geometry that asks for the convex shape of smallest area that can cover every planar set...

the theory of NP-completeness to problems related to independent sets. The independent set problem and the clique problem are complementary: a clique in...

their surroundings. Other domains, where this problem is applied, are in image editing, lighting problems of a stage or installation of infrastructures...

on non-trivial problems with 100 items, and outperforms the BCP (branch-and-cut-and-price) algorithm by Belov and Scheithauer on problems that have fewer...

biomedical engineer who has worked on DNA sequencing theory, covering and matching problems in probability, theoretical fluid mechanics, and co-wrote Phred...

optimization problems are known to be NP-hard; the decision versions of these problems are classical examples of NP-complete problems. Both problems can be...

In topology, a covering or covering projection is a map between topological spaces that, intuitively, locally acts like a projection of multiple copies...

In coding theory, a covering code is a set of elements (called codewords) in a space, with the property that every element of the space is within a fixed...

algorithms for other types of optimization problems work by solving linear programming problems as sub-problems. Historically, ideas from linear programming...

modulus on a covering system. Unsolved problem in mathematics Does there exist a covering system with odd distinct moduli? More unsolved problems in mathematics...

the Steiner tree problem, or minimum Steiner tree problem, named after Jakob Steiner, is an umbrella term for a class of problems in combinatorial optimization...

However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions (where the problem becomes circle packing in...

monotone dualization is a computational problem of constructing the dual of a monotone Boolean function. Equivalent problems can also be formulated as constructing...

subgraphs), needed to cover all edges in E. A collection of bicliques covering all edges in G is called a biclique edge cover, or sometimes biclique cover...

In mathematics, a covering set for a sequence of integers refers to a set of prime numbers such that every term in the sequence is divisible by at least...

A mathematical chess problem is a mathematical problem which is formulated using a chessboard and chess pieces. These problems belong to recreational...

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...

with the number of cities. The problem was first formulated in 1930 and is one of the most intensively studied problems in optimization. It is used as...