Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling
Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in a map and for each feature a set of label candidates, a common problem is to select an independent set of labels (that is, a labeling without label–label i...
Main Authors: | Jan-Henrik Haunert, Alexander Wolff |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-11-01
|
Series: | ISPRS International Journal of Geo-Information |
Subjects: | |
Online Access: | https://www.mdpi.com/2220-9964/6/11/342 |
Similar Items
-
Modifying Orthogonal Drawings for Label Placement
by: Konstantinos G. Kakoulis, et al.
Published: (2016-03-01) -
A Study on Topological Integer Additive Set-Labeling of Graphs
by: Sudev Naduvath
Published: (2015-03-01) -
Topological Integer Additive Set-Sequential Graphs
by: Sudev Naduvath, et al.
Published: (2015-07-01) -
Application of the Combinatorial Nullstellensatz to Integer-magic Graph Labelings
by: Richard Low, et al.
Published: (2022-02-01) -
Prime labeling of families of trees with Gaussian integers
by: Steven Klee, et al.
Published: (2016-08-01)