Heuristics for the Maximum Outerplanar Subgraph Problem

Authors:
Timo Poranen
Affiliations:
Department of Computer Sciences, University of Tampere, Finland FIN-33014
Venue:
Journal of Heuristics
Year:
2005

Citing 18
Cited 1

Recognizing outerplanar graphs in linear time

International Workshop WG '86 on Graph-theoretic concepts in computer science
Simulated annealing: theory and applications

Simulated annealing: theory and applications
Optimization by simulated annealing: an experimental evaluation. Part I, graph partitioning

Operations Research
Optimization by simulated annealing: an experimental evaluation; part II, graph coloring and number partitioning

Operations Research
Fast detection and display of symmetry in outerplanar graphs

Discrete Applied Mathematics
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
The sizes of maximal planar, outerplanar, and bipartite planar subgraphs

Discrete Mathematics
Augmenting outerplanar graphs

Journal of Algorithms
A better approximation algorithm for finding planar subgraphs

Journal of Algorithms
Fully dynamic planarity testing with applications

Journal of the ACM (JACM)
A new planarity test

Theoretical Computer Science
An analysis of some heuristics for the maximum planar subgraph problem

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Stop minding your p's and q's: a simplified O(n) planar embedding algorithm

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions

GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Two new approximation algorithms for the maximum planar subgraph problem

Acta Cybernetica

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determining the maximum outerplanar subgraph of a given graph is known to be an NP-complete problem. In the literature there are no earlier experiment on approximating the maximum outerplanar subgraph problem. In this paper we compare solution quality and running times of different heuristics for finding maximum outerplanar subgraphs. We compare a greedy heuristic against a triangular cactus heuristic and its greedy variation. We also use the solutions from the greedy heuristics as initial solutions for a simulated annealing algorithm.The main experimental result is that simulated annealing with initial solution taken from the greedy triangular cactus heuristic yields the best known approximations for the maximum outerplanar subgraph problem.