Parallel circle-cover algorithms

DOI10.1016/0020-0190(88)90068-3MaRDI QIDQ1108792zbMATH OpenOpenAlexFDO

Authors Alan A. Bertossi

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90068-3

zbMATH Keywords

SMMcomputational geometryparallel algorithmsparallel processingcircle-cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Recommendations

• An optimal parallel circle-cover algorithm
• A parallel circle-cover minimization algorithm
• An optimal parallel algorithm for the minimum circle-cover problem
• Parallel algorithms on circular-arc graphs
• On a circle-cover minimization problem

Cites work

• scientific article; zbMATH DE number 3905859 (Why is no real title available?)
• An improved parallel algorithm for maximal matching
• An introduction to parallelism in combinatorial optimization
• Binary Trees and Parallel Scheduling Algorithms
• Bounds to Complexities of Networks for Sorting and for Switching
• On a circle-cover minimization problem
• Parallel Matrix and Graph Algorithms
• Some parallel algorithms on interval graphs

Cited in

(9)

• Capacitated Arc Stabbing
• On a circle-cover minimization problem
• Algorithms for interval structures with applications
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• An optimal parallel algorithm for the minimum circle-cover problem
• A parallel circle-cover minimization algorithm
• Optimal parallel algorithm for shortest-paths problem on interval graphs
• An optimal parallel circle-cover algorithm
• Placing segments on parallel arcs

This page was built for publication: Parallel circle-cover algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108792)