74 search results - page 1 / 15 » A note on the size of minimal covers |
IPL
2007
13 years 4 months ago
2007
EJC
2008
13 years 4 months ago
2008
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
DAM
2010
13 years 4 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
IPL
2011
12 years 11 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
COMGEO
2011
ACM
12 years 12 months ago
2011
ACM
In this note, we show that the size of the perimeter of (α, β)-covered objects is a linear function of the diameter. Specifically, for an (α, β)-covered object O, per(O) ≤ c...