ORL
2007
13 years 3 months ago
2007
We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous resul...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
We show that the number of straight-edge triangulations exhibited by any set of n points in general position in the plane is bounded from below by (2.33n). 2004 Elsevier B.V. All ...
JCT
2006
13 years 4 months ago
2006
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
EOR
2006
13 years 4 months ago
2006
In a network of subassembly lines, balance becomes more difficult to achieve as it requires that all subassembly lines be synchronized to produce at the same rate. We show how to ...
AMC
2006
13 years 4 months ago
2006
A Mond
DAM
2008
13 years 4 months ago
2008
Given graphs G, G1, . . . , Gk, where k 2, the notation G (G1, G2, . . . , Gk) denotes that every factorization F1 F2