EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
From MaRDI portal
Recommendations
Cites work
Cited in
(11)- Polynomial time algorithms for three-label point labeling.
- scientific article; zbMATH DE number 1629978 (Why is no real title available?)
- scientific article; zbMATH DE number 1670674 (Why is no real title available?)
- Dynamic Point Labeling is Strongly PSPACE-Complete
- scientific article; zbMATH DE number 2089213 (Why is no real title available?)
- Determining a set of maximum inscribed rectangles for label placement in a region
- scientific article; zbMATH DE number 1796965 (Why is no real title available?)
- POINT SET LABELING WITH SPECIFIED POSITIONS
- An efficient and effective approximation algorithm for the Map Labeling Problem
- New approximation algorithms for map labeling with sliding labels
- A new approximation algorithm for labeling points with circle pairs
This page was built for publication: EFFICIENT APPROXIMATION 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 Q4682165)