Wavelength conversion in shortest-path all-optical networks
暂无分享,去创建一个
[1] B. Mukherjee,et al. A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .
[2] Carsten Lund,et al. The Approximation of Maximum Subgraph Problems , 1993, ICALP.
[3] Piotr Berman,et al. A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..
[4] Peter Winkler,et al. Ring routing and wavelength translation , 1998, SODA '98.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] Mihalis Yannakakis,et al. Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.
[7] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[8] Satish Rao,et al. An approximate max-flow min-cut relation for undirected multicommodity flow, with applications , 1995, Comb..
[9] Amit Kumar,et al. Wavelength conversion in optical networks , 1999, SODA '99.
[10] D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .
[11] Thomas Erlebach,et al. Wavelength conversion in networks of bounded treewidth , 2002 .
[12] Toshihiro Fujito. A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties , 1997, ICALP.
[13] Thomas Erlebach,et al. Wavelength Conversion in Shortest-Path All-Optical Networks , 2003, ISAAC.
[14] Mihalis Yannakakis,et al. Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..
[15] Thomas Erlebach,et al. On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements , 2003, STACS.