New algorithms for two-label point labeling
From MaRDI portal
Recommendations
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
- A new fast heuristic for labeling points
- A new approximation algorithm for labeling points with circle pairs
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
- Optimal algorithm for a special point-labeling problem
- scientific article; zbMATH DE number 2089214
- scientific article; zbMATH DE number 2080265
- scientific article; zbMATH DE number 1796965
Cited in
(15)- A simple factor-3 approximation for labeling points with circles
- Polynomial time algorithms for three-label point labeling.
- A new bound for map labeling with uniform circle pairs
- Trimming of graphs, with application to point labeling
- Optimal point removal in closed-2PM labeling
- A combinatorial theorem on labeling squares with points and its application
- scientific article; zbMATH DE number 2089213 (Why is no real title available?)
- scientific article; zbMATH DE number 2080265 (Why is no real title available?)
- EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
- LABELING POINTS WITH CIRCLES
- A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
- Minimum point-overlap labelling*
- Algorithms and Computation
- A new approximation algorithm for labeling points with circle pairs
- Matching points with rectangles and squares
This page was built for publication: New algorithms for two-label point labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753953)
