An optimal parallel circle-cover algorithm

Dilip Sarkar, Ivan Stojmenović

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.

Original languageEnglish (US)
Pages (from-to)3-6
Number of pages4
JournalInformation Processing Letters
Volume32
Issue number1
DOIs
StatePublished - Jul 3 1989

Fingerprint

Arc of a curve
Circle
Cover
Models of Computation
Optimal Algorithm
Parallel algorithms
Parallel Algorithms
Union

Keywords

  • Analysis of algorithms
  • circle-cover
  • combinatorial problems
  • computational geometry
  • parallel processing

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

An optimal parallel circle-cover algorithm. / Sarkar, Dilip; Stojmenović, Ivan.

In: Information Processing Letters, Vol. 32, No. 1, 03.07.1989, p. 3-6.

Research output: Contribution to journalArticle

Sarkar, Dilip ; Stojmenović, Ivan. / An optimal parallel circle-cover algorithm. In: Information Processing Letters. 1989 ; Vol. 32, No. 1. pp. 3-6.
@article{d106818ab8384cd6a0478ae5c822a51a,
title = "An optimal parallel circle-cover algorithm",
abstract = "Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.",
keywords = "Analysis of algorithms, circle-cover, combinatorial problems, computational geometry, parallel processing",
author = "Dilip Sarkar and Ivan Stojmenović",
year = "1989",
month = "7",
day = "3",
doi = "10.1016/0020-0190(89)90060-4",
language = "English (US)",
volume = "32",
pages = "3--6",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - An optimal parallel circle-cover algorithm

AU - Sarkar, Dilip

AU - Stojmenović, Ivan

PY - 1989/7/3

Y1 - 1989/7/3

N2 - Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.

AB - Given a set of n circular arcs, we provide an optimal parallel algorithm (on the CREW PRAM model of computation) for finding a minimum number of circular arcs whose union covers the circle. The algorithm runs in O(log n) time with O(n) processors and uses O(n) space. This is a significant improvement over the recent algorithm by Bertossi that runs in O(log n) time with O(n2) processors and uses O(n2) space.

KW - Analysis of algorithms

KW - circle-cover

KW - combinatorial problems

KW - computational geometry

KW - parallel processing

UR - http://www.scopus.com/inward/record.url?scp=0024960529&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024960529&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(89)90060-4

DO - 10.1016/0020-0190(89)90060-4

M3 - Article

AN - SCOPUS:0024960529

VL - 32

SP - 3

EP - 6

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -