On a circle-cover minimization problem
From MaRDI portal
Recommendations
Cites work
Cited in
(28)- Parallel circle-cover algorithms
- An optimal parallel algorithm for the minimum circle-cover problem
- An optimal algorithm for finding dominating cycles in circular-arc graphs
- Incorporating negative-weight vertices in certain vertex-search graph algorithms
- Efficient parallel recognition of some circular arc graphs. I
- Moldable and castable polygons
- A parallel circle-cover minimization algorithm
- An optimal parallel circle-cover algorithm
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
- Computational aspects of relaxation complexity
- On the comparison of bacteriophage populations
- On interval and circular-arc covering problems
- Assigning weights to minimize the covering radius in the plane
- Capacitated Arc Stabbing
- Computational aspects of relaxation complexity: possibilities and limitations
- Optimal circle covering problems and their applications
- Optimal parallel algorithm for shortest-paths problem on interval graphs
- Algorithms for interval structures with applications
- On the minimum dummy-arc problem
- Parallel algorithms on circular-arc graphs
- Fuzzy versions of the covering circle problem
- Distributed computing with the Cloud
- Distributed Computing with the Cloud
- Efficient parallel recognition of some circular arc graphs. II
- Algorithms for halfplane coverage and related problems
- Computing instance-optimal kernels in two dimensions
- Algorithms for halfplane coverage and related problems
- Polynomial-time algorithms for contiguous art gallery and related problems
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)
