29 search results - page 3 / 6 » siamcomp 2000 |
SIAMCOMP
2000
13 years 4 months ago
2000
We consider the practical problem of constructing binary space partitions (BSPs) for a set S of n orthogonal, nonintersecting, two-dimensional rectangles in R3 such that the aspect...
SIAMCOMP
2000
13 years 4 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
SIAMCOMP
2000
13 years 4 months ago
2000
We investigate a conjecture stated by Coffman, Flatto, and Wright within the context of a stochastic machine minimization problem with a hard deadline. We prove that the conjecture...
SIAMCOMP
2000
13 years 4 months ago
2000
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
SIAMCOMP
2000
13 years 4 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...