k best cuts for circular-arc graphs

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a set of n weighted circular-arcs on a unit circle, and an integer k, the k Best Cuts for Circular-Arcs problem, abbreviated as 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. We then define the k Restricted Best Cuts for Intervals (k-RBCI) problem, and solve it in the same complexity of k-BCI algorithm. These two algorithms are then used as subroutines to solve the k-BCCA problem in O(kn + n log n) or O(I(k)+ n log n) time, where I(k) is the time complexity of k-BCI problem. We also show that if k > 1, the k Maximum Cliques Cover problem for circular-arc graphs can be solved in O(I(k) + n log n) time.

Cite

CITATION STYLE

APA

Tsai, K. H., & Lee, D. T. (1994). k best cuts for circular-arc graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 550–558). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_222

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free