Optimal point removal in closed-2PM labeling

DOI10.1016/j.ipl.2007.08.033zbMath1184.68268OpenAlexW2137167352MaRDI QIDQ2380053

Mohammad Ghodsi, Ramtin Khosravi, Farshad Rostamabadi, Iman Sadeghi

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.033

zbMATH Keywords

computational complexitymap labeling

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• A polynomial time solution for labeling a rectilinear map
• Labeling a rectilinear map more efficiently
• Incremental labeling in closed-2PM model
• Label updating to avoid point-shaped obstacles in fixed model

This page was built for publication: Optimal point removal in closed-2PM labeling