1. Alon, N., Feige, U., Wigderson, A., Zuckerman, D.: Derandomized graph products. Computational Complexity 5, 60–75 (1995)
2. Awerbuch, B., Azar, Y., Plotkin, S.A.: Throughput-competitive on-line routing. In: Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS), pp. 32–40 (1993)
3. Awerbuch, B., Azar, Y., Plotkin, S.A., Waarts, O.: Competitive routing of virtual circuits with unknown duration. In: Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 321–327 (1994)
4. Bari, F., Chowdhury, S.R., Ahmed, R., Boutaba, R.: On orchestrating virtual network functions in NFV. CoRR (2015)
5. Bazgan, C., Escoffier, B., Paschos, V.T.: Completeness in standard and differential approximation classes: Poly-(d)apx- and (d)ptas-completeness. Theoretical Computer Science 339(2-3), 272–292 (2005)