Sciweavers

823 search results - page 14 / 165
» Stateful Subset Cover
Sort
View
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 10 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang
JCT
2002
107views more  JCT 2002»
13 years 10 months ago
Asymmetric Binary Covering Codes
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
TCS
2010
13 years 8 months ago
Non-cooperative facility location and covering games
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...
Jean Cardinal, Martin Hoefer
ICALP
2010
Springer
14 years 10 days ago
Covering and Packing in Linear Space
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
Andreas Björklund, Thore Husfeldt, Petteri Ka...
IPCO
2007
77views Optimization» more  IPCO 2007»
13 years 11 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli