## Abstract

Given a set of*n* nonnegative*weighted* circular arcs on a unit circle, and an integer*k*, the*k* Best Cust for Circular-Arcs problem, abbreviated as the*k*-BCCA problem, is to find a placement of*k* points, called*cuts*, on the circle such that the total weight of the arcs that contain at least one cut is maximized.

We first solve a simpler version, the*k* Best Cuts for Intervals (*k*-BCI) problem, in*O(kn*+*n* log*n*) time and*O(kn)* space using dynamic programming. The algorithm is then extended to solve a variation, called the*k*-restricted BCI problem, and the space complexity of the*k*-BCI problem can be improved to*O(n)*. Based on these results, we then show that the*k*-BCCA problem can be solved in*O(I(k,n)*+*n*log*n*) time, where*I(k, n)* is the time complexity of the*k*-BCI problem. As a by-product, the*k* Maximum Cliques Cover problem (*k*>1) for the circular-arc graphs can be solved in*O(I(k,n)*+*n*log*n*) time.

## Key Words

Circular-arc graph Interval graph Facility location Competitive location Maximum clique cover## Preview

Unable to display preview. Download preview PDF.

## References

- [1]A. Aggarwal, M. Klawe, S. Moran, P. Shor, and R. Wilbur, Geometric applications of a matrix-searching algorithm,
*Algorithmica*,**2**(1987), 195–208.MATHMathSciNetCrossRefGoogle Scholar - [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.Google Scholar - [3]A. V. Aho, J. E. Hopcroft, and J. D. Ullman,
*The Design and Analysis of Computer Algorithms*, Addison-Wesley, Reading, MA, 1974.MATHGoogle Scholar - [4]M. Ben-Or, Lower bounds for algebraic computation trees,
*Proc. 15th Annual Symp. on Theory of Computing*, 1983, pp. 80–86.Google Scholar - [5]Z. Drezner, Competitive location strategies for two facilities,
*Regional Sci. Urban Econ.*,**12**(1982), 485–493.CrossRefGoogle Scholar - [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.Google Scholar - [7]S. L. Hakimi, On locating new facilities in a competitive environment,
*ISOLDE II*, June 1981, Skodsborg, Denmark.Google Scholar - [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.Google Scholar - [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.Google Scholar - [10]D. T. Lee, M. Sarrafzadeh and Y. F. Wu, Minimum cut for circular-arc graphs,
*SIAM J. Comput.*,**19**(6) (1990), 1041–1050.MATHMathSciNetCrossRefGoogle Scholar - [11]D. T. Lee and Y. F. Wu, Geometric complexity of some location problems,
*Algorithmica*,**1**(1985), 193–211.MathSciNetCrossRefGoogle Scholar - [12]A. S. Rao and C. P. Rangan, Optimal parallel algorithms on circular arc graphs,
*Inform. Process. Lett.*,**33**(1989), 147–156.MATHMathSciNetCrossRefGoogle Scholar - [13]Y. F. Wu, Geometric Location and Distance Problems, Ph.D. Dissertation, Dept. of EE/CS, Northwestern University, 1985.Google Scholar