Sciweavers

24 search results - page 2 / 5
» jcss 2008
Sort
View
JCSS
2008
63views more  JCSS 2008»
13 years 4 months ago
Approximation of satisfactory bisection problems
Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
JCSS
2008
65views more  JCSS 2008»
13 years 4 months ago
Efficient algorithms for counting parameterized list H-colorings
Josep Díaz, Maria J. Serna, Dimitrios M. Th...
JCSS
2008
70views more  JCSS 2008»
13 years 4 months ago
The complexity of properly learning simple concept classes
Michael Alekhnovich, Mark Braverman, Vitaly Feldma...
JCSS
2008
96views more  JCSS 2008»
13 years 4 months ago
Precedence constrained scheduling in (2 - 7/(3p+1)) optimal
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
Devdatta Gangal, Abhiram G. Ranade
JCSS
2008
62views more  JCSS 2008»
13 years 4 months ago
Maximal repetitions in strings
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...
Maxime Crochemore, Lucian Ilie