Maximizing the Number of Connections in Optical Tree Networks
暂无分享,去创建一个
[1] Eli Upfal,et al. Efficient routing in all-optical networks , 1994, STOC '94.
[2] Panos M. Pardalos,et al. Multichannel optical networks : theory and practice : DIMACS Workshop, March 16-19, 1998 , 1998 .
[3] Mihalis Yannakakis,et al. The Maximum k-Colorable Subgraph Problem for Chordal Graphs , 1987, Inf. Process. Lett..
[4] Mihalis Yannakakis,et al. Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover , 1993, ICALP.
[5] Klaus Jansen,et al. Scheduling of Virtual Connections in Fast Networks , 1996, Universität Trier, Mathematik/Informatik, Forschungsbericht.
[6] Satish Rao,et al. Efficient access to optical bandwidth , 1995, FOCS 1995.
[7] Vijay Kumar,et al. Improved Access to Optimal Bandwidth in Trees , 1997, SODA.
[8] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[9] Klaus Jansen,et al. Constrained Bipartite Edge Coloring with Applications to Wavelength Routing , 1997, ICALP.
[10] Christos Kaklamanis,et al. Efficient Wavelength Routing on Directed Fiber Trees , 1996, ESA.
[11] Amos Fiat,et al. On-line Competive Algorithms for Call Admission in Optical Networks , 1996, ESA.
[12] Satish Rao,et al. Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.