-
1
-
-
77951210452
-
The regenerator location problem
-
Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205-220 (2010)
-
(2010)
Networks
, vol.55
, Issue.3
, pp. 205-220
-
-
Chen, S.1
Ljubic, I.2
Raghavan, S.3
-
2
-
-
0031209110
-
Graph decomposition is NP-complete: A complete proof of Holyer's conjecture
-
PII S0097539792229507
-
Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer's conjecture. SIAM Journal on Computing 26(4), 1166-1187 (1997) (Pubitemid 127599141)
-
(1997)
SIAM Journal on Computing
, vol.26
, Issue.4
, pp. 1166-1187
-
-
Dor, D.1
Tarsi, M.2
-
3
-
-
0000927535
-
Paths, trees, and flowers
-
Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449-467 (1965)
-
(1965)
Canad. J. Math.
, vol.17
, pp. 449-467
-
-
Edmonds, J.1
-
4
-
-
77955315262
-
A Framework for Regenerator Site Selection Based on Multiple Paths
-
to appear
-
Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: A Framework for Regenerator Site Selection Based on Multiple Paths. In: Prooceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)
-
(2010)
Prooceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC)
-
-
Fedrizzi, R.1
Galimberti, G.M.2
Gerstel, O.3
Martinelli, G.4
Salvadori, E.5
Saradhi, C.V.6
Tanzi, A.7
Zanardi, A.8
-
5
-
-
77953918510
-
Traffic Independent Heuristics for Regenerator Site Selection for Providing Any-to-Any Optical Connectivity
-
to appear
-
Fedrizzi, R., Galimberti, G.M., Gerstel, O., Martinelli, G., Salvadori, E., Saradhi, C.V., Tanzi, A., Zanardi, A.: Traffic Independent Heuristics for Regenerator Site Selection for Providing Any-to-Any Optical Connectivity. In: Proceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC) (to appear, 2010)
-
(2010)
Proceedings of IEEE/OSA Conference on Optical Fiber Communications (OFC)
-
-
Fedrizzi, R.1
Galimberti, G.M.2
Gerstel, O.3
Martinelli, G.4
Salvadori, E.5
Saradhi, C.V.6
Tanzi, A.7
Zanardi, A.8
-
6
-
-
79955476008
-
On the complexity of the regenerator placement problem in optical networks
-
to appear
-
Flammini, M., Marchetti-Spaccamela, A., Monaco, G., Moscardelli, L., Zaks, S.: On the complexity of the regenerator placement problem in optical networks. IEEE/ACM Transactions on Networking (to appear, 2010)
-
(2010)
IEEE/ACM Transactions on Networking
-
-
Flammini, M.1
Marchetti-Spaccamela, A.2
Monaco, G.3
Moscardelli, L.4
Zaks, S.5
-
7
-
-
77956095155
-
Minimizing total busy time in parallel scheduling with application to optical networks
-
Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theoretical Computer Science 411(40-42), 3553-3562 (2010)
-
(2010)
Theoretical Computer Science
, vol.411
, Issue.40-42
, pp. 3553-3562
-
-
Flammini, M.1
Monaco, G.2
Moscardelli, L.3
Shachnai, H.4
Shalom, M.5
Tamir, T.6
Zaks, S.7
-
8
-
-
51849102465
-
Approximating the traffic grooming problem with respect to adms and oadms
-
Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. Springer, Heidelberg
-
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem with respect to adms and oadms. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 920-929. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5168
, pp. 920-929
-
-
Flammini, M.1
Monaco, G.2
Moscardelli, L.3
Shalom, M.4
Zaks, S.5
-
9
-
-
78650874787
-
-
Technical report, Faculty of Computer Science, Technion September
-
Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Optimizing regenerator cost in traffic grooming. Technical report, Faculty of Computer Science, Technion (September 2010), http://www.cs.technion.ac.il/users/ wwwb/cgi-bin/tr-info.cgi/2010/CS/CS-2010-16
-
(2010)
Optimizing Regenerator Cost in Traffic Grooming
-
-
Flammini, M.1
Monaco, G.2
Moscardelli, L.3
Shalom, M.4
Zaks, S.5
-
10
-
-
0035245501
-
Regenerator placement algorithms for connection establishment in all-optical networks
-
Kim, S.W., Seo, S.W.: Regenerator placement algorithms for connection establishment in all-optical networks. IEE Proceedings Communications 148(1), 25-30 (2001)
-
(2001)
IEE Proceedings Communications
, vol.148
, Issue.1
, pp. 25-30
-
-
Kim, S.W.1
Seo, S.W.2
-
11
-
-
77955333302
-
Placing regenerator in optical networks: New model, hardness results and algorithms
-
Gavoille, C. (ed.) ICALP 2010, Part II. Springer, Heidelberg
-
Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing regenerator in optical networks: New model, hardness results and algorithms. In: Gavoille, C. (ed.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 333-344. Springer, Heidelberg (2010)
-
(2010)
LNCS
, vol.6199
, pp. 333-344
-
-
Mertzios, G.B.1
Sau, I.2
Shalom, M.3
Zaks, S.4
-
12
-
-
49449096166
-
Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks
-
Optical Society of America, paper OWA2
-
Pachnicke, S., Paschenda, T., Krummrich, P.M.: Physical Impairment Based Regenerator Placement and Routing in Translucent Optical Networks. In: Optical Fiber Communication Conference and Exposition and The National Fiber Optic Engineers Conference (Optical Society of America, paper OWA2) (2008)
-
(2008)
Optical Fiber Communication Conference and Exposition and the National Fiber Optic Engineers Conference
-
-
Pachnicke, S.1
Paschenda, T.2
Krummrich, P.M.3
-
13
-
-
2942596079
-
Static vs. dynamic regenerator assignment in optical switches: Models and cost trade-offs
-
Sriram, K., Griffith, D., Su, R., Golmie, N.: Static vs. dynamic regenerator assignment in optical switches: models and cost trade-offs. In: Workshop on High Performance Switching and Routing (HPSR), pp. 151-155 (2004)
-
(2004)
Workshop on High Performance Switching and Routing (HPSR)
, pp. 151-155
-
-
Sriram, K.1
Griffith, D.2
Su, R.3
Golmie, N.4
-
14
-
-
0038415955
-
Wavelength assignment and generalized interval graph coloring
-
Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830-831 (2003)
-
(2003)
SODA
, pp. 830-831
-
-
Winkler, P.1
Zhang, L.2
-
16
-
-
21244476317
-
Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing
-
Yang, X., Ramamurthy, B.: Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications 10(1), 39-53 (2005)
-
(2005)
Photonic Network Communications
, vol.10
, Issue.1
, pp. 39-53
-
-
Yang, X.1
Ramamurthy, B.2
|