EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
From MaRDI portal
Publication:4682165
DOI10.1142/S0218195901000584zbMath1074.68671MaRDI QIDQ4682165
Publication date: 10 June 2005
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
A new approximation algorithm for labeling points with circle pairs ⋮ Polynomial time algorithms for three-label point labeling. ⋮ DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION
Cites Work