- Algorithms
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Covering problems

- Algorithms
- >
- Search algorithms
- >
- Combinatorial optimization
- >
- Covering problems

- Combinatorics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Covering problems

- Computational mathematics
- >
- Combinatorial algorithms
- >
- Combinatorial optimization
- >
- Covering problems

- Graph theory
- >
- Network theory
- >
- Combinatorial optimization
- >
- Covering problems

- Mathematical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Covering problems

- Numerical analysis
- >
- Mathematical optimization
- >
- Combinatorial optimization
- >
- Covering problems

- Operations research
- >
- Network theory
- >
- Combinatorial optimization
- >
- Covering problems

Bipartite dimension

In the mathematical fields of graph theory and combinatorial optimization, the bipartite dimension or biclique cover number of a graph G = (V, E) is the minimum number of bicliques (that is complete b

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 197

Edge cover

In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.In computer science, the minimum edge cover problem is the p

Bin covering problem

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 certain given total size, in a way that maximizes

Art gallery problem

The art gallery problem or museum problem is a well-studied visibility problem in computational geometry. It originates from the following real-world problem: "In an art gallery, what is the minimum n

Vertex cover

In graph theory, a vertex cover (sometimes node cover) of a graph is a set of vertices that includes at least one endpoint of every edge of the graph. In computer science, the problem of finding a min

Covering problems

In combinatorics and computer science, covering problems are computational problems that ask whether a certain combinatorial structure 'covers' another, or how large the structure has to be to do that

Disk covering problem

The disk covering problem asks for the smallest real number such that disks of radius can be arranged in such a way as to cover the unit disk. Dually, for a given radius ε, one wishes to find the smal

Polygon covering

In geometry, a covering of a polygon is a set of primitive units (e.g. squares) whose union equals the polygon. A polygon covering problem is a problem of finding a covering with a smallest number of

© 2023 Useful Links.