Author:
Blogowski Alexandre,Chrétienne Philippe,Pascual Fanny
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference15 articles.
1. E. Anshelevich, A. Dasgupta, J. Kleinberg, É. Tardos, T. Wexler and T. Roughgarden, The price of stability for network design with fair cost allocation, inSymp. on Foundations of Computer Science (FOCS)(2004) 295–304.
2. A. Barlett and N.N. Jackson, Network planning considerations for network sharing in umts, inThird Int. Conf. on 3G Mobile Communication Technologies, pages 17–21. Motorola UK (2002).
3. Cohen J., Cordeiro D., Trystram D. and Wagner F., Multi-organization scheduling approximation algorithms.Concurrency and Computation: Pract. Exper.23(2011) 2220–2234.
4. D. Cordeiro, P.F. Dutot, G. Mounié and D. Trystram, Tight analysis of relaxed multi-organization scheduling algorithms, in25th IEEE International Parallel and Distributed Processing Symposium (IPDPS)(2011) 1177–1186.
5. Dutot P.F., Pascual F., Rzadca K. and Trystram D., Approximation algorithms for the multi-organization scheduling problem.IEEE Trans. Parallel Distrib. Syst.22(2011) 1888–1895.