3415 search results - page 101 / 683 » Lower Bounds for Kernelizations |
DM
2010
15 years 2 months ago
2010
118
click to vote
ECCC
2010
15 years 2 months ago
2010
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
124
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem rais...
226
click to vote
WAOA
2010
Springer
15 years 1 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...