, Volume 18, Issue 2, pp 198–216

k best cuts for circular-arc graphs

  • K. H. Tsai
  • D. T. Lee

DOI: 10.1007/BF02526033

Cite this article as:
Tsai, K.H. & Lee, D.T. Algorithmica (1997) 18: 198. doi:10.1007/BF02526033


Given a set ofn nonnegativeweighted circular arcs on a unit circle, and an integerk, thek Best Cust for Circular-Arcs problem, abbreviated as thek-BCCA problem, is to find a placement ofk points, calledcuts, 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, thek Best Cuts for Intervals (k-BCI) problem, inO(kn+n logn) time andO(kn) space using dynamic programming. The algorithm is then extended to solve a variation, called thek-restricted BCI problem, and the space complexity of thek-BCI problem can be improved toO(n). Based on these results, we then show that thek-BCCA problem can be solved inO(I(k,n)+nlogn) time, whereI(k, n) is the time complexity of thek-BCI problem. As a by-product, thek Maximum Cliques Cover problem (k>1) for the circular-arc graphs can be solved inO(I(k,n)+nlogn) time.

Key Words

Circular-arc graphInterval graphFacility locationCompetitive locationMaximum clique cover

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • K. H. Tsai
    • 1
  • D. T. Lee
    • 2
  1. 1.Institute of Information ScienceAcademia SinicaTaipeiTaiwan
  2. 2.Department of Electrical and Computer EngineeringNorthwestern UniversityEvanstonUSA