Approximating circular arc colouring and bandwidth allocation in all-optical ring networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1444, Issue , 1998, Pages 147-158

  Kumar, Vijay ^a  

^a NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION; WAVELENGTH DIVISION MULTIPLEXING;

ALL OPTICAL; CIRCULAR ARC; CIRCULAR-ARC GRAPH; PERFORMANCE RATIO; RANDOMIZED APPROXIMATION; RING NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 84958964595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0053971     Document Type: Conference Paper

References (17)

1. Azuma, K. Weighted Sum of Certain Dependent Random Variables. Tohoku Mathematical Journal, 19:357-367, 1967.
2. Cosares, S., Carpenter, T., and Saniee, I. Static Routing and Slotting of Demand in SONET Rings. Presented at the TIMS/ORSA Joint National Meeting, Boston, MA, 1994.
3. Erlebach, T. and Jansen, K. Call Scheduling in Trees, Rings and Meshes. In Proc. 30th Hawaii International Conf. on System Sciences, 1997.
4. Even, S., Itai, A., and Shamir, A. On the complexity of timetable and multicommodity flow problems, SIAM Journal of Computing, 5(1976),691-703.
5. Garey, M.R., Johnson, D.S., Miller, G.L. and Papadimitriou, C.H. The Complexity of Coloring Circular Arcs and Chords. SIAM J. Alg. Disc. Meth., 1(2):216-227, 1980.
6. Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1980.
7. Kaklamanis, C. and Persiano, P. Efficient wavelength routing on directed fiber trees. In Proc. 4th Annual European Symposium on Algorithms, 1996.
8. Kumar, V. and Schwabe, E.J. Improved access to optical bandwidth in trees. In Proc 8th Annual ACM-SIAM Syrup. on Discrete Algorithms, pp. 437-444, 1997.
9. McDiarmid, C. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, volume 141 of LMS Lecture Notes Series, pages 148-188. 1989.
10. Mihail, M., Kaklamanis, C., and Rao, S. Efficient Access to Optical Bandwidth. In Proc IEEE Syrup on Foundations of Comp Sci, pp. 548-557, 1995.
11. Motwani, R., and Raghavan, P. Randomized Algorithms, Cambridge University Press, 1995.
12. 2) Algorithm for Coloring Proper Circular Arc Graphs. SIAM J. Alg. Disc. Meth., 2(2):88-93, 1981.
13. Raghavan, P. Randomized Rounding and Discrete Ham-Sandwiches: Provably Good Algorithms for Routing and Packing Problems. PhD Thesis, CS Division, UC Berkeley, 1986.
14. Raghavan, P., and Upfal, E. Efficient Routing in An-Optical Networks. In Proc 26th ACM Syrup on Theory of Computing, pp. 134-143, 1994.
15. Shih, W.K. and Hsu, W.L. An Approximation Algorithm for Coloring Circular-Arc Graphs. SIAM Conference on Discrete Mathematics, 1990.
16. Settembre, M. and Matera, F. All-optical implementations of high capacity TDMA networks. Fiber and Integrated Optics, 12:173-186, 1993.
17. Tucker, A. Coloring a Family of Circular Arcs. SIAM J. Appl. Math., 29(3):493-502, 1975.