Polynomial time algorithms for three-label point labeling.

DOI10.1016/S0304-3975(02)00433-4zbMath1044.68158MaRDI QIDQ1401261

Rob Duncan, Binhai Zhu, Jianbo Qian, Antoine Vigneron

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

AlgorithmsNP-hardnessMap labeling

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (5)

Label updating to avoid point-shaped obstacles in fixed model ⋮ Algorithms for the multiple label placement problem ⋮ Trimming of graphs, with application to point labeling ⋮ LABELING POINTS ON A SINGLE LINE ⋮ Matching points with rectangles and squares

Cites Work

• A polynomial time solution for labeling a rectilinear map
• New approximation algorithms for map labeling with sliding labels
• Label placement by maximum independent set in rectangles
• Point labeling with sliding labels
• Approximate map labeling is in \(\Omega (n\log n)\)
• Time bounds for selection
• A new bound for map labeling with uniform circle pairs
• The Problem of Compatible Representatives
• EFFICIENT APPROXIMATION ALGORITHMS FOR TWO-LABEL POINT LABELING
• LABELING POINTS WITH CIRCLES
• Static and dynamic algorithms for k-point clustering problems
• Point set labeling with specified positions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polynomial time algorithms for three-label point labeling.