A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for computing the Voronoi diagram of a convex polygon
- A new bound for map labeling with uniform circle pairs
- A new linear algorithm for intersecting convex polygons
- A practical map labeling algorithm.
- LABELING POINTS WITH CIRCLES
- New approximation algorithms for map labeling with sliding labels
- Point labeling with sliding labels
Cited in
(7)- scientific article; zbMATH DE number 1670674 (Why is no real title available?)
- LABELING POINTS WITH CIRCLES
- A new approximation algorithm for labeling points with circle pairs
- A simple factor-3 approximation for labeling points with circles
- A new bound for map labeling with uniform circle pairs
- scientific article; zbMATH DE number 2080265 (Why is no real title available?)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
This page was built for publication: A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818561)