An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
An Efficient and Effective Approximation Algorithm for the Map Labeling Problem
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
INFORMS Journal on Computing
A Computational Study of Search Strategies for Mixed Integer Programming
INFORMS Journal on Computing
Fast algorithms for vertex packing and related problems
Fast algorithms for vertex packing and related problems
Using Genetic Algorithms for Solving Hard Problems in GIS
Geoinformatica
Optimal Labelling of Point Features in the Slider Model
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
Journal of Visual Languages and Computing
Conversion of coloring algorithms into maximum weight independent set algorithms
Discrete Applied Mathematics
GreedyMAX-type algorithms for the maximum independent set problem
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Computing the independence number of intersection graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dispersion for the point-feature cartographic label placement problem
Expert Systems with Applications: An International Journal
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We consider the following map labelling problem: given distinct points p1, p2, ..., pn in the plane, find a set of pairwise disjoint axis-parallel squares Q1,Q2, ..., Qn where pi is a corner of Qi. This problem reduces to that of finding a maximum independent set in a graph.We present a branch and cut algorithm for finding maximum independent sets and apply it to independent set instances arising from map labelling. The algorithm uses a new technique for setting variables in the branch and bound tree that implicitly exploits the Euclidean nature of the independent set problems arising from map labelling. Computational experiments show that this technique contributes to controlling the size of the branch and bound tree. We also present a novel variant of the algorithm for generating violated odd-hole inequalities. Using our algorithm we can find provably optimal solutions for map labelling instances with up to 950 cities within modest computing time, a considerable improvement over the results reported on in the literature.