2252 search results - page 298 / 451 » Lower Bounds for Dynamic Algorithms |
131
Voted
EOR
2002
15 years 3 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
137
Voted
MP
2007
15 years 3 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
145
click to vote
INFORMS
2010
15 years 1 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...
146
Voted
MFCS
2010
Springer
15 years 1 months ago
2010
Springer
We consider evaluating one bilinear form defined by a sparse Ny × Nx matrix A having h entries on w pairs of vectors The model of computation is the semiring I/O-model with main ...
125
Voted
GI
2009
Springer
15 years 1 months ago
2009
Springer
Abstract: The work presented in this article generalizes the modeling of task scheduling problems with sequence dependent setup time on the basis of task scheduling on single respe...