On a circle-cover minimization problem

DOI10.1016/0020-0190(84)90033-4MaRDI QIDQ790622zbMATH OpenOpenAlexFDO

Authors N. E. Zubov

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

zbMATH Keywords

analysis of algorithmscomputational geometryminimum covercircular- arcs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• A parallel circle-cover minimization algorithm
• Parallel circle-cover algorithms
• An optimal parallel algorithm for the minimum circle-cover problem
• An optimal parallel circle-cover algorithm
• Minimum Cuts for Circular-Arc Graphs

Cites work

• scientific article; zbMATH DE number 3891419 (Why is no real title available?)
• Algorithms on circular-arc graphs
• An Efficient Test for Circular-Arc Graphs
• Coloring a Family of Circular Arcs
• Efficient algorithms for interval graphs and circular-arc graphs
• Structure theorems for some circular-arc graphs

Cited in

(24)

• Distributed computing with the Cloud
• Parallel circle-cover algorithms
• Distributed Computing with the Cloud
• 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
• An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
• Fuzzy versions of the covering circle problem
• 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
• Efficient parallel recognition of some circular arc graphs. II
• A parallel circle-cover minimization algorithm
• Incorporating negative-weight vertices in certain vertex-search graph algorithms
• On interval and circular-arc covering problems
• 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

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)