Parallel circle-cover algorithms
From MaRDI portal
Publication:1108792
DOI10.1016/0020-0190(88)90068-3zbMATH Open0654.68048OpenAlexW1965213248MaRDI QIDQ1108792FDOQ1108792
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
Recommendations
Analysis of algorithms and problem complexity (68Q25) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Cites Work
- An improved parallel algorithm for maximal matching
- On a circle-cover minimization problem
- Parallel Matrix and Graph Algorithms
- Binary Trees and Parallel Scheduling Algorithms
- An introduction to parallelism in combinatorial optimization
- Bounds to Complexities of Networks for Sorting and for Switching
- Some parallel algorithms on interval graphs
- Title not available (Why is that?)
Cited In (9)
- An optimal parallel algorithm for the minimum circle-cover problem
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- An optimal parallel circle-cover algorithm
- On a circle-cover minimization problem
- Capacitated Arc Stabbing
- Optimal parallel algorithm for shortest-paths problem on interval graphs
- A parallel circle-cover minimization algorithm
- Placing segments on parallel arcs
- Algorithms for interval structures with applications
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)
