Poranen, Timo: Two new approximation algorithms for the maximum planar subgraph problem. In: Acta cybernetica, (18) 3. pp. 503527. (2008)

Cikk, tanulmány, mű
Poranen_2008_ActaCybernetica.pdf Download (267kB)  Preview 
Abstract
The maximum planar subgraph problem (MPS) is defined as follows: given a graph G, find a largest planar subgraph of G. The problem is NPhard and it has applications in graph drawing and resource location optimization. Călinescu et al. [J. Alg. 27, 269302 (1998)] presented the first approximation algorithms for MPS with nontrivial performance ratios. Two algorithms were given, a simple algorithm which runs in linear time for boundeddegree graphs with a ratio 7/18 and a more complicated algorithm with a ratio 4/9. Both algorithms produce outerplanar subgraphs. In this article we present two new versions of the simpler algorithm. The first new algorithm still runs in the same time, produces outerplanar subgraphs, has at least the same performance ratio as the original algorithm, but in practice it finds larger planar subgraphs than the original algorithm. The second new algorithm has similar properties to the first algorithm, but it produces only planar subgraphs. We conjecture that the performance ratios of our algorithms are at least 4/9 for MPS. We experimentally compare the new algorithms against the original simple algorithm. We also apply the new algorithms for approximating the thickness and outerthickness of a graph. Experiments show that the new algorithms produce clearly better approximations than the original simple algorithm by Călinescu et al.
Item Type:  Article 

Heading title:  Regular papers 
Journal or Publication Title:  Acta cybernetica 
Date:  2008 
Volume:  18 
Number:  3 
ISSN:  0324721X 
Page Range:  pp. 503527 
Language:  angol 
Uncontrolled Keywords:  Természettudomány, Informatika 
Additional Information:  Bibliogr.: p. 525527.; Abstract 
Date Deposited:  2016. Oct. 15. 12:25 
Last Modified:  2018. Jun. 05. 14:37 
URI:  http://acta.bibl.uszeged.hu/id/eprint/12832 
Actions (login required)
View Item 