New approximation algorithms for map labeling with sliding labels

DOI10.1023/A:1013326409918zbMath1058.90080OpenAlexW1593503904MaRDI QIDQ702357

Binhai Zhu, Zhongping Qin

Publication date: 17 January 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013326409918

zbMATH Keywords

NP-hardnessApproximation algorithmsmap labeling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (3)

A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING ⋮ Polynomial time algorithms for three-label point labeling. ⋮ A combinatorial theorem on labeling squares with points and its application

This page was built for publication: New approximation algorithms for map labeling with sliding labels