-
1
-
-
0028317867
-
Efficient routing and scheduling algorithms for optical networks
-
A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan, Efficient routing and scheduling algorithms for optical networks, in "Proc. 5th ACM-SIAM Symp. on Discrete Algorithms," 1994.
-
(1994)
Proc. 5th ACM-SIAM Symp. on Discrete Algorithms
-
-
Aggarwal, A.1
Bar-Noy, A.2
Coppersmith, D.3
Ramaswami, R.4
Schieber, B.5
Sudan, M.6
-
2
-
-
0346304542
-
Bandwidth allocation algorithms on tree-shaped all-optical networks with wavelength converters
-
V. Auletta, I. Caragiannis, C. Kaklamanis, and P. Persiano, Bandwidth allocation algorithms on tree-shaped all-optical networks with wavelength converters, in "Proc. SIROCCO," 1997.
-
(1997)
Proc. SIROCCO
-
-
Auletta, V.1
Caragiannis, I.2
Kaklamanis, C.3
Persiano, P.4
-
4
-
-
84955602886
-
Constant factor approximation of the weighted feedback vertex set problem
-
"Proc. Intl. Symposium on Algorithms and Computation," Springer-Verlag, Berlin/New York
-
V. Bafna, P. Berman, and T. Fujito, Constant factor approximation of the weighted feedback vertex set problem, in "Proc. Intl. Symposium on Algorithms and Computation," Lecture Notes in Computer Science, Vol. 1004, pp. 142-151, Springer-Verlag, Berlin/New York, 1995.
-
(1995)
Lecture Notes in Computer Science
, vol.1004
, pp. 142-151
-
-
Bafna, V.1
Berman, P.2
Fujito, T.3
-
5
-
-
0028255806
-
Approximation algorithms for NP-complete problems on planar graphs
-
B. Baker, Approximation algorithms for NP-complete problems on planar graphs, Assoc. Comput. Mach. 41 (1994), 153-180.
-
(1994)
Assoc. Comput. Mach.
, vol.41
, pp. 153-180
-
-
Baker, B.1
-
6
-
-
0028196393
-
Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference
-
R. Bar-Yehuda, D. Geiger, J. Naor, and R. Roth, Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference, in "Proc. 5th ACM-SIAM Symp. on Discrete Algorithms," 1994.
-
(1994)
Proc. 5th ACM-SIAM Symp. on Discrete Algorithms
-
-
Bar-Yehuda, R.1
Geiger, D.2
Naor, J.3
Roth, R.4
-
7
-
-
0030170201
-
All-optical network consortium - Ultrafast TDM networks
-
R. A. Barry, V. W. S. Chan, K. L. Hall, E. S. Kintzer, J. D. Moores, K. A. Rauschenbach, E. A. Swanson, L. E. Adams, C. R. Doerr, S. G. Finn, H. A. Haus, E. P. Ippen, W. S. Wong, and M. Haner, All-optical network consortium - Ultrafast TDM networks, IEEE J. Selected Areas Commun. 14(5) (1996), 999-1013.
-
(1996)
IEEE J. Selected Areas Commun.
, vol.14
, Issue.5
, pp. 999-1013
-
-
Barry, R.A.1
Chan, V.W.S.2
Hall, K.L.3
Kintzer, E.S.4
Moores, J.D.5
Rauschenbach, K.A.6
Swanson, E.A.7
Adams, L.E.8
Doerr, C.R.9
Finn, S.G.10
Haus, H.A.11
Ippen, E.P.12
Wong, W.S.13
Haner, M.14
-
9
-
-
0032058416
-
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
-
F. Chudak, M. Goemans, D. Hochbaum, and D. Williamson, A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs, Oper. Res. Lett. 22 (1998), 111-118.
-
(1998)
Oper. Res. Lett.
, vol.22
, pp. 111-118
-
-
Chudak, F.1
Goemans, M.2
Hochbaum, D.3
Williamson, D.4
-
10
-
-
0002721363
-
Parametrized computational feasibility
-
(P. Clote and J. Remmel, Eds.), Birkhauser, Basel
-
R. Downey, M. Fellows, Parametrized computational feasibility, in "Feasible Mathematics II," (P. Clote and J. Remmel, Eds.), Birkhauser, Basel, 1994.
-
(1994)
Feasible Mathematics II
-
-
Downey, R.1
Fellows, M.2
-
14
-
-
0002932511
-
Approximations for the disjoint paths problem in high-diameter planar networks
-
J. Kleinberg and É. Tardos, Approximations for the disjoint paths problem in high-diameter planar networks, in "Proc. 27th ACM Symp. on Theory of Computing," pp. 26-35, 1995.
-
(1995)
Proc. 27th ACM Symp. on Theory of Computing
, pp. 26-35
-
-
Kleinberg, J.1
Tardos, É.2
-
15
-
-
0346304541
-
On the benefits of wavelength translation in all-optical clear-channel networks
-
M. Kovacevic and A. Acampora, On the benefits of wavelength translation in all-optical clear-channel networks, in "Proc. IEEE INFOCOM," 1995.
-
(1995)
Proc. IEEE INFOCOM
-
-
Kovacevic, M.1
Acampora, A.2
-
17
-
-
0027222431
-
Routing and switching in a wavelength convertible optical network
-
K.C. Lee and V. Li, Routing and switching in a wavelength convertible optical network, in "Proc. IEEE INFOCOM," 1993.
-
(1993)
Proc. IEEE INFOCOM
-
-
Lee, K.C.1
Li, V.2
-
19
-
-
0001029324
-
Applications of a planar separator theorem
-
R. Lipton and R. Tarjan, Applications of a planar separator theorem, SIAM J. Comput. 9 (1980).
-
(1980)
SIAM J. Comput.
, vol.9
-
-
Lipton, R.1
Tarjan, R.2
-
25
-
-
0031336242
-
Multiwavelength optical networks with limited wavelength conversion
-
R. Ramaswami and G. Sasaki, Multiwavelength optical networks with limited wavelength conversion, in "Proc. IEEE INFOCOM," 1997.
-
(1997)
Proc. IEEE INFOCOM
-
-
Ramaswami, R.1
Sasaki, G.2
-
26
-
-
0000455611
-
Decomposition by clique separators
-
R. Tarjan, Decomposition by clique separators, Discrete Math. 55 (1985), 221-232.
-
(1985)
Discrete Math.
, vol.55
, pp. 221-232
-
-
Tarjan, R.1
|