Games for Routing and Path Coloring
Publisher
Birkhäuser Boston
Reference22 articles.
1. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs and non-approximability—towards tight results. SIAM J. Comput. 27, 804–915 (1998)
2. LNCS;V. Bilo,2005
3. Optical Switching and Networking;V. Bilo,2010
4. LNCS;V. Bilo,2004
5. Erlebach, T., Jansen, K., Kaklamanis, C., Persiano, P.: Optimal wavelength routing on directed fiber trees. Theor. Comput. Sci. 221(1–2), 119–137 (1999)