Sciweavers

19 search results - page 2 / 4
» jda 2008
Sort
View
JDA
2008
96views more  JDA 2008»
13 years 4 months ago
Approximating the traffic grooming problem
Michele Flammini, Luca Moscardelli, Mordechai Shal...
JDA
2008
59views more  JDA 2008»
13 years 4 months ago
Realizing partitions respecting full and partial order information
Erik D. Demaine, Jeff Erickson, Danny Krizanc, Hen...
JDA
2008
67views more  JDA 2008»
13 years 4 months ago
On minimum k-modal partitions of permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result
Gabriele Di Stefano, Stefan Krause, Marco E. L&uum...
JDA
2008
88views more  JDA 2008»
13 years 4 months ago
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
Cristina Bazgan, Zsolt Tuza
JDA
2008
85views more  JDA 2008»
13 years 4 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...