k Best Cuts for Circular-Arc Graphs

Algorithmica (New York)

Volumn 18, Issue 2, 1997, Pages 198-216

  Tsai, K H ^a   Lee, D T ^b  

^a INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^b Northwestern University   (United States)

Author keywords

Circular arc graph; Competitive location; Facility location; Interval graph; Maximum clique cover

Indexed keywords

EID: 0348230450     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02526033     Document Type: Article

References (13)

1. A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilbur, Geometric applications of a matrix-searching algorithm, Algorithmica, 2 (1987), 195-208.
2. A. Aggarwal, B. Schieber, and T. Tokuyama, Finding a minimum-weight K-link path in graphs with Monge property and applications, Proc. 9th Symp. on Computational Geometry, 1993, pp. 189-197.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
4. M. Ben-Or, Lower bounds for algebraic computation trees, Proc. 15th Annual Symp. on Theory of Computing, 1983, pp. 80-86.
5. Z. Drezner, Competitive location strategies for two facilities, Regional Sci. Urban Econ., 12 (1982), 485-493.
6. H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, Proc. 15th ACM Symp. on Theory of Computing, Boston, MA, Apr. 25-27, 1983, pp. 246-251.
7. S. L. Hakimi, On locating new facilities in a competitive environment, ISOLDE II, June 1981, Skodsborg, Denmark.
8. W.-L. Hsu and K. H. Tsai, Linear time algorithms on circular-arc graphs, Proc. 26th Allerton Conf. on Communication, Control and Computing, 1988, pp. 842-851.
9. D. T. Lee, Maximum clique problem of rectangle graphs, In Advances in Computing Research, F. P. Preparata, ed., JAI Press, Greenwich, CT, 1983, pp. 91-107.
10. D. T. Lee, M. Sarrafzadeh and Y. F. Wu, Minimum cut for circular-arc graphs, SIAM J. Comput., 19(6) (1990), 1041-1050.
11. D. T. Lee and Y. F. Wu, Geometric complexity of some location problems, Algorithmica, 1 (1985), 193-211.
12. A. S. Rao and C. P. Rangan, Optimal parallel algorithms on circular arc graphs, Inform. Process. Lett., 33 (1989), 147-156.
13. Y.F. Wu, Geometric Location and Distance Problems, Ph.D. Dissertation, Dept. of EE/CS, Northwestern University, 1985.