An approximation algorithm for circular arc colouring

Algorithmica (New York)

Volumn 30, Issue 3, 2001, Pages 406-417

  Kumar, V ^a,b  

^a IBM RESEARCH INDIA   (India)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Circular arc graph; Colouring; Randomized rounding

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY;

CIRCULAR ARC GRAPHS;

COMPUTER SCIENCE;

EID: 0141542095     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0023-9     Document Type: Article

References (15)

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, pp. 221-222.
4. Even, S., Itai, A., and Shamir, A. On the Complexity of Timetable and Multi-Commodity Flow Problems. SIAM Journal of Computing, 5:691-703, 1976.
5. Garey, M.R., Johnson, D.S., Miller, G.L., and Papadimitriou, C.H. The Complexity of Coloring Circular Arcs and Chords. SIAM Journal on Algebraic and Discrete Mathematics, 1(2):216-227, 1980.
6. Golumbic, M.C. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
7. Karapetian, I.A. On Coloring of Arc Graphs. Akademiia nauk Armianskoi SSR Doklady, 70:306-311, 1980.
8. Motwani, R., and Raghavan, P. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
9. Raghavan, P. Randomized Rounding and Discrete Ham-Sandwiches: Provably Good Algorithms for Routing and Packing Problems. Ph.D. Thesis, CS Division, UC Berkeley, 1986.
10. Raghavan, P., and Thompson, C.D. Randomized Rounding: A Technique for Provably Good Algorithms and Algorithmic Proofs. Combinatorica, 7:365-374, 1987.
11. Raghavan, P., and Upfal, E. Efficient Routing in All-Optical Networks. In Proc. 26th ACM Symp. on Theory of Computing, pp. 134-143, 1994.
12. 1.5) Algorithm to Colour Proper Circular Arcs. Discrete Applied Mathematics, 25(3):321-323, 1989.
13. Shih, W.K., and Hsu, W.L. An Approximation Algorithm for Coloring Circular-Arc Graphs. SIAM Conference on Discrete Mathematics, 1990.
14. Settembre, M., and Matera, F. All-Optical Implementations of High Capacity TDMA Networks. Fiber and Integrated Optics, 12:173-186, 1993.
15. Tucker, A. Coloring a Family of Circular Arcs. SIAM Journal on Applied Mathematics, 29(3):493-502, 1975.