Optimal Point Movement for Covering Circular Regions
نویسندگان
چکیده
منابع مشابه
Single-change circular covering designs
A single-change circular covering design (scccd) based on the set [v] = { 1 . . . . . t:} with block size k is an ordered collection o f b blocks, ~ = {Bi . . . . . B/,}, each B~ C [v], which obey: ( 1 ) each block differs from the previous block by a single element, as does the last from the first, and, (2) every pair of [v] is covered by some block. The object is to minimize b for a fixed v a...
متن کاملAsymptotically Optimal Covering Designs
A (v, k, t) covering design, or covering, is a family of k-subsets, called blocks, chosen from a v-set, such that each t-subset is contained in at least one of the blocks. The number of blocks is the covering’s size, and the minimum size of such a covering is denoted by C(v, k, t). It is easy to see that a covering must contain at least (v t )
متن کاملCovering Paths for Planar Point Sets
Given n points in the plane, a covering path is a polygonal path that visits all the points. If no three points are collinear, every covering path requires at least n/2 segments, and n − 1 straight line segments obviously suffice even if the covering path is required to be noncrossing. We show that every set of n points in the plane admits a (possibly self-crossing) covering path consisting of ...
متن کاملOptimal Covering Codes
Let (n, M)R denote any binary code with length n, cardinality M and covering radius R. The classification of (2R+3, 7)R codes is settled for any R = 1, 2, . . . , and a characterization of these (optimal) codes is obtained. It is shown that, for R = 1, 2, . . . , the numbers of inequivalent (2R+3, 7)R codes form the sequence 1, 3, 8, 17, 33, . . . identified as A002625 in the Encyclopedia of In...
متن کاملOptimal semi-online algorithms for machine covering
This paper investigates the semi-online machine covering problems on m ≥ 3 parallel identical machines. Three different semi-online versions are studied and optimal algorithms are proposed. We prove that if the total processing time of all jobs or the largest processing time of all jobs is known in advance, the competitive ratios of the optimal algorithms are both m − 1. If the total processing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-013-9857-1