On a circle-cover minimization problem
From MaRDI portal
Publication:790622
DOI10.1016/0020-0190(84)90033-4zbMATH Open0534.68049OpenAlexW2013817894MaRDI QIDQ790622FDOQ790622
Publication date: 1984
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(84)90033-4
Recommendations
Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)
Cites Work
Cited In (23)
- Distributed Computing with the Cloud
- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- Assigning weights to minimize the covering radius in the plane
- On the comparison of bacteriophage populations
- Parallel algorithms on circular-arc graphs
- Fuzzy versions of the covering circle problem
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- An optimal parallel circle-cover algorithm
- Optimal circle covering problems and their applications
- On the minimum dummy-arc problem
- Capacitated Arc Stabbing
- Moldable and castable polygons
- Optimal parallel algorithm for shortest-paths problem on interval graphs
- Computational aspects of relaxation complexity
- A parallel circle-cover minimization algorithm
- Efficient parallel recognition of some circular arc graphs. II
- Incorporating negative-weight vertices in certain vertex-search graph algorithms
- Computational aspects of relaxation complexity: possibilities and limitations
- Efficient parallel recognition of some circular arc graphs. I
- Algorithms for interval structures with applications
- An optimal algorithm for finding dominating cycles in circular-arc graphs
- Distributed computing with the Cloud
This page was built for publication: On a circle-cover minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790622)
