73
Views
4
CrossRef citations to date
0
Altmetric
Original Articles

A simulated annealing algorithm for the maximum planar subgraph problem

Pages 555-568 | Received 26 Nov 2003, Accepted 03 Dec 2003, Published online: 12 May 2010
 

Abstract

In this paper, we introduce a new heuristic algorithm for finding maximum planar subgraphs of a graph. Our algorithm is based on the simulated annealing optimization scheme. We compare the quality of the solutions and running times of our algorithm with greedy randomized adaptive search procedure (GRASP) and branch-and-cut heuristics. We show that simulated annealing is an efficient method to find planar subgraphs with a large number of edges. The algorithm clearly outperforms earlier heuristic algorithms; it is faster and its solution quality is better. The algorithm is very simple, although it needs an implementation for the planarity test.

Acknowledgement

This work was funded by the Tampere Graduate School in Information Science and Engineering (TISE) and supported by the Academy of Finland (Project 51528).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.