An optimization algorithm for maximum independent set with applications in map labelling

Bram Verweij, Karen Aardal

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

26 Citations (Scopus)

Abstract

We consider the following map labelling problem: given distinct points p 1, p 2,...,p n in the plane, find a set of pairwise disjoint axis-parallel squares Q 1,Q 2,...,Q n where p i is a corner of Q i . 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.
Original languageEnglish
Title of host publicationAlgorithms
Subtitle of host publicationESA '99, 7th Annual European Symposium on Algorithms
Place of PublicationBerlin
PublisherSpringer
Pages426-437
Number of pages12
ISBN (Electronic)978-3-540-48481-3
ISBN (Print)978-3-540-66251-8
DOIs
Publication statusPublished - 1999
Externally publishedYes

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume1643

Keywords

  • Maximum Clique
  • Valid Inequality
  • Path Decomposition
  • Maximum Clique Problem
  • Closed Walk

Fingerprint

Dive into the research topics of 'An optimization algorithm for maximum independent set with applications in map labelling'. Together they form a unique fingerprint.

Cite this