1 / 8

Necklace with Colored Beads Cutting Problem

Necklace with Colored Beads Cutting Problem. Victor Kostyuk Advisor: Michael Capalbo. Problem Setup. Consider a necklace (cycle) with 2 n beads of k colors. There are 2 a i beads of color i, and the beads are arranged on the necklace arbitrarily. Goal - Efficient Cutting Alg.

jared-mason
Download Presentation

Necklace with Colored Beads Cutting Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Necklace with Colored Beads Cutting Problem Victor Kostyuk Advisor: Michael Capalbo

  2. Problem Setup Consider a necklace (cycle) with 2n beads of k colors. There are 2aibeads of color i, and the beads are arranged on the necklace arbitrarily.

  3. Goal - Efficient Cutting Alg. Is there an O(nc) algorithm for making the least number of cuts between beads such that the resulting bead strings can be partitioned into two groups, with aibeads of color i per group?

  4. Notes and Prospects • Goldberg and West (1985) proved that such a partition is always possible with k+1 cuts. • There is an O(nk-2) algorithm for finding least number of cuts, but no O(nc) algorithm is known where c is independent of k. • While such O(nc) algorithm might not exist, an improvement on O(nk-2) is a possibility. • Perhaps O(nc) algorithm exits for O(k) cuts.

  5. Any questions?

More Related