A parallel circle-cover minimization algorithm

Laurence Boxer; Russ Miller

doi:10.1016/0020-0190(89)90031-8

A parallel circle-cover minimization algorithm

Laurence Boxer
, Russ Miller

Department of Computer Science and Engineering

Niagara University

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

Given a set of n circular arcs distributed arbitrarily on a PRAM with n processors, we give an optimal Θ(log n) time algorithm to solve the problem of determining a minimal set of circular arcs whose union covers the circle.

Original language	English
Pages (from-to)	57-60
Number of pages	4
Journal	Information Processing Letters
Volume	32
Issue number	2
DOIs	https://doi.org/10.1016/0020-0190(89)90031-8
State	Published - Jul 24 1989

Keywords

Circle cover
CREW PRAM
list ranking

Access to Document

10.1016/0020-0190(89)90031-8

Cite this

@article{6d0bde61938e4176a0aa569c773b99f5,

title = "A parallel circle-cover minimization algorithm",

abstract = "Given a set of n circular arcs distributed arbitrarily on a PRAM with n processors, we give an optimal Θ(log n) time algorithm to solve the problem of determining a minimal set of circular arcs whose union covers the circle.",

keywords = "Circle cover, CREW PRAM, list ranking",

author = "Laurence Boxer and Russ Miller",

year = "1989",

month = jul,

day = "24",

doi = "10.1016/0020-0190(89)90031-8",

language = "English",

volume = "32",

pages = "57--60",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - A parallel circle-cover minimization algorithm

AU - Boxer, Laurence

AU - Miller, Russ

PY - 1989/7/24

Y1 - 1989/7/24

N2 - Given a set of n circular arcs distributed arbitrarily on a PRAM with n processors, we give an optimal Θ(log n) time algorithm to solve the problem of determining a minimal set of circular arcs whose union covers the circle.

AB - Given a set of n circular arcs distributed arbitrarily on a PRAM with n processors, we give an optimal Θ(log n) time algorithm to solve the problem of determining a minimal set of circular arcs whose union covers the circle.

KW - Circle cover

KW - CREW PRAM

KW - list ranking

UR - https://www.scopus.com/pages/publications/0024700063

U2 - 10.1016/0020-0190(89)90031-8

DO - 10.1016/0020-0190(89)90031-8

M3 - Article

AN - SCOPUS:0024700063

SN - 0020-0190

VL - 32

SP - 57

EP - 60

JO - Information Processing Letters

JF - Information Processing Letters

IS - 2

ER -

A parallel circle-cover minimization algorithm

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this