Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Amato, G., Cattaneo, G., Italiano, G.F.: Experimental analysis of dynamic minimum spanning tree algorithms. In: Proc. of 8th SODA (1997)
2. Archetti, C., Bertazzi, L., Speranza, M.G.: Reoptimizing the 0-1 knapsack problem. Discrete Applied Mathematics 158(17) (2010)
3. Ausiello, G., Bonifaci, V., Escoffier, B.: Complexity and approximation in reoptimization. In: Cooper, B., Sorbi, A. (eds.) Computability in Context: Computation and Logic in the Real World. Imperial College Press/World Scientific (2011)
4. Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of minimum and maximum traveling salesmans tours. J. of Discrete Algorithms 7(4), 453–463 (2009)
5. Baram, G., Tamir, T.: Reoptimization of the minimum total flow-time scheduling problem (full version),
http://www.faculty.idc.ac.il/tami/Papers/BTfull.pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Cost-Oblivious Reallocation for Scheduling and Planning;Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures;2015-06-13