A new approximation algorithm for finding heavy planar subgraphs
type: Item
instance of: scholarly article
title: A new approximation algorithm for finding heavy planar subgraphs
zbMATH Open document ID: 1045.68101
author: Gruia Calinescu
author: Cristina G. Fernandes
author: Howard Karloff
author: Alex Zelikovsky
published in: Algorithmica
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1964903
zbMATH Keywords: Weighted planar graph
zbMATH Keywords: Approximation algorithm
zbMATH Keywords: Performance ratio
MaRDI profile type: Publication
full work available at URL: s00453-002-1020-3
OpenAlex ID: W1564988587
DOI: 10.1007/S00453-002-1020-3
Recommended article: A Better Approximation Algorithm for Finding Planar Subgraphs
Recommended article: Q4875164
Recommended article: Q3615285
Recommended article: Analysis of heuristics for finding a maximum weight planar subgraph
Recommended article: Q3043706
Recommended article: A linear time algorithm for finding maximal planar subgraphs
Recommended article: A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
Recommended article: Q5140734
Recommended article: A Note on the Practicality of Maximal Planar Subgraph Algorithms
Recommended article: Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
description: scientific article; zbMATH DE number 1964903