Approximation and Online Algorithms: 12th International Workshop, WAOA 2014, Wro
64,79 €
The 22 revised full papers presented were carefully reviewed and selected from 49 submissions. Improved Approximations for the Max k-Colored Clustering Problem. - Better Algorithms for Online Bin Stretching.
Jetzt bei Ebay:
