Optimal point removal in closed-2PM labeling

DOI10.1016/J.IPL.2007.08.033MaRDI QIDQ2380053zbMATH OpenOpenAlexFDO

Authors Farshad Rostamabadi, Iman Sadeghi, Mohammad Ghodsi, Ramtin Khosravi

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)

Recommendations

• Incremental labeling in closed-2PM model
• Label updating to avoid point-shaped obstacles in fixed model
• scientific article; zbMATH DE number 1670674
• Point labeling with sliding labels
• scientific article; zbMATH DE number 2089214

Cites work

• A polynomial time solution for labeling a rectilinear map
• scientific article; zbMATH DE number 6472588 (Why is no real title available?)
• Incremental labeling in closed-2PM model
• Label updating to avoid point-shaped obstacles in fixed model
• Labeling a rectilinear map more efficiently

Cited in

(2)

• Minimum point-overlap labelling*
• Incremental labeling in closed-2PM model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380053)