Sentence examples for covering problems from inspiring English sources

Our approximation algorithm makes use of the local ratio technique, which is useful for approximating optimization covering problems such as vertex cover, dominating set, minimum spanning tree, feedback vertex set and more [ 33, 40, 41].

Minimum weight covering problems have played an important role in many real applications.

This paper investigates the semi-online machine covering problems on m≥3 parallel identical machines.

In this paper we study machine covering problems with combined partial information on m parallel identical machines.

Location covering problems, though well studied in the literature, typically consider only nodal (i.e. point) demand coverage.

In this paper, two typical minimum weight covering problems, namely vertex covering problem and edge covering problem, are studied under stochastic environments.

The set multicovering or set k-covering problem is an extension of the classical set covering problem, in which each object is required to be covered at least k times.

Edge covering problem (ECP) is to find an edge cover with the minimum weight in a graph.

The covering problem aims at keeping the region under surveillance well-covered by relocating available vehicles.

We consider a type of covering problem in cellular networks.

First, a quadratic formulation is proposed for single allocation hub set covering problem.