A new approximation algorithm for finding heavy planar subgraphs
From MaRDI portal
Publication:1400892
DOI10.1007/S00453-002-1020-3zbMATH Open1045.68101OpenAlexW1564988587MaRDI QIDQ1400892FDOQ1400892
Authors: Gruia Calinescu, Cristina G. Fernandes, Howard Karloff, Alex 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
Recommendations
- A Better Approximation Algorithm for Finding Planar Subgraphs
- scientific article; zbMATH DE number 871895
- Two new approximation algorithms for the maximum planar subgraph problem
- Analysis of heuristics for finding a maximum weight planar subgraph
- scientific article; zbMATH DE number 2084267
- A linear time algorithm for finding maximal planar subgraphs
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- Exact algorithms for the maximum planar subgraph problem: new models and experiments
- A note on the practicality of maximal planar subgraph algorithms
- Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Cited In (11)
- A \((1/2+1/60)\)-approximation algorithm for maximum weight series-parallel subgraph
- On the \(k\)-restricted structure ratio in planar and outerplanar graphs
- Analysis of heuristics for finding a maximum weight planar subgraph
- Finding triangles for maximum planar subgraphs
- An improved algorithm for finding maximum outerplanar subgraphs
- Finding large planar subgraphs and large subgraphs of a given genus
- Heuristics for the maximum outerplanar subgraph problem
- A note on the maximum weight planar subgraph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum series-parallel subgraph
This page was built for publication: A new approximation algorithm for finding heavy planar subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400892)
