Covering $\mathbb R$ with translates of a compact set
نویسندگان
چکیده
منابع مشابه
On covering by translates of a set
In this paper we study the minimal number τ(S,G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of such coverings. We focus mainly on finite subsets in discrete groups, reviewing the classical results in this area, and generalizing them to a much broader context. For example, we show that while the worst-case efficiency when ...
متن کاملGlobal existence, stability results and compact invariant sets for a quasilinear nonlocal wave equation on $mathbb{R}^{N}$
We discuss the asymptotic behaviour of solutions for the nonlocal quasilinear hyperbolic problem of Kirchhoff Type [ u_{tt}-phi (x)||nabla u(t)||^{2}Delta u+delta u_{t}=|u|^{a}u,, x in mathbb{R}^{N} ,,tgeq 0;,]with initial conditions $u(x,0) = u_0 (x)$ and $u_t(x,0) = u_1 (x)$, in the case where $N geq 3, ; delta geq 0$ and $(phi (x))^{-1} =g (x)$ is a positive function lying in $L^{N/2}(mathb...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملA set-covering formulation for a drayage problem with single and double container loads
This paper addresses a drayage problem, which is motivated by the case study of a real carrier. Its trucks carry one or two containers from a port to importers and from exporters to the port. Since up to four customers can be served in each route, we propose a set-covering formulation for this problem where all possible routes are enumerated. This model can be efficiently solved to optimality b...
متن کاملA Local Branching Approach for the Set Covering Problem
The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2002
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-02-06773-4