1554 search results - page 73 / 311 » Parameterized Complexity and Approximation Algorithms |
131
click to vote
STOC
2005
ACM
15 years 8 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
117
click to vote
DLT
2003
15 years 4 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
110
click to vote
ALGORITHMICA
2002
15 years 2 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
118
click to vote
DAM
2007
15 years 2 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
134
click to vote
IPL
2002
15 years 2 months ago
2002
One of the main reasons for using parallel evolutionary algorithms (PEAs) is to obtain efficient algorithms with an execution time much lower than that of their sequential counter...