JCO
2010
13 years 5 months ago
2010
We study a class of scheduling problems with batch setups for the online-list and online-time paradigms. Jobs are to be scheduled in batches for processing. All jobs in a batch st...
JCO
2010
13 years 5 months ago
2010
Let Fn q be a n-dimensional vector space over Fq. In this paper we construct a new family of inclusion matrices associated with subspaces of Fn q, and exhibit their disjunct proper...
JCO
2010
13 years 5 months ago
2010
JCO
2010
13 years 9 months ago
2010
JCO
2010
13 years 9 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
JCO
2010
13 years 9 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
JCO
2010
13 years 9 months ago
2010
In this paper, we construct a dz-disjunct matrix with the orthogonal spaces over finite fields of odd characteristic. We consider the arrangement problem of d (m−1,2(s −1),s ...
JCO
2010
13 years 9 months ago
2010
Online scheduling with a buffer is a semi-online problem which is strongly related to the basic online scheduling problem. Jobs arrive one by one and are to be assigned to paralle...
JCO
2010
13 years 9 months ago
2010
An important task in the theory of hypercubes is to establish the maximum integer fn such that for every set F of f vertices in the hypercube Qn, with 0 ≤ f ≤ fn, there exists ...