340-350 Remark Extended abstract.
Full version is here .
Given a set of labels L, each of which belongs to a point feature in the plane, the task is to find a largest subset L P of L so that each l in L P labels the corresponding point feature and no two labels from L P overlap. Our approach is based on two so-called constraint graphs, which code horizontal and vertical positioning relations. This enables us to formulate a zero-one integer linear program whose solution leads to an optimal labelling. We can express LNM in both the discrete and the slider labelling model. The slider model allows a continuous movement of a label around its point feature, leading to a significantly higher number of labels that can be placed.