A new approximation algorithm for finding heavy planar subgraphs

DOI10.1007/s00453-002-1020-3zbMath1045.68101OpenAlexW1564988587MaRDI QIDQ1400892

Gruia Călinescu, Cristina G. Fernandes, Howard J. Karloff, Alexander Z. Zelikovsky

Publication date: 17 August 2003

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-002-1020-3

zbMATH Keywords

Approximation algorithmPerformance ratioWeighted planar graph

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Maximum series-parallel subgraph ⋮ An improved algorithm for finding maximum outerplanar subgraphs ⋮ Finding Triangles for Maximum Planar Subgraphs ⋮ Unnamed Item ⋮ Heuristics for the maximum outerplanar subgraph problem

This page was built for publication: A new approximation algorithm for finding heavy planar subgraphs