The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...
An asymmetric binary covering code of length n and radius R is a subset C of the n-cube Qn such that every vector x Qn can be obtained from some vector c C by changing at most R...
Joshua N. Cooper, Robert B. Ellis, Andrew B. Kahng
We study the following variant of the bin covering problem. We are given a set of unit sized items, where each item has a color associated with it. We are given an integer paramet...
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Remote sensing based on imagery has traditionally been the main tool used to extract land uses and land cover (LULC) maps. However, more powerful tools are needed in order to fulfi...