A Better Approximation Algorithm for Finding Planar Subgraphs

Recommendations

scientific article; zbMATH DE number 871895
A new approximation algorithm for finding heavy planar subgraphs
Two new approximation algorithms for the maximum planar subgraph problem
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
Approximation algorithms for NP-complete problems on planar graphs

Cited in

(39)

Non-planar core reduction of graphs
Analysis of heuristics for finding a maximum weight planar subgraph
A new approximation algorithm for finding heavy planar subgraphs
On the complexity of the approximation of nonplanarity parameters for cubic graphs
Maximum planar subgraphs and nice embeddings: Practical layout tools
Maximum series-parallel subgraph
On maximum planar induced subgraphs
Heuristics for the maximum outerplanar subgraph problem
Large planar subgraphs in dense graphs
An algorithmic metatheorem for directed treewidth
Algebraic algorithms for linear matroid parity problems
Limits of greedy approximation algorithms for the maximum planar subgraph problem
A subset spanner for Planar graphs, with application to subset TSP
A note on the practicality of maximal planar subgraph algorithms
Finding triangles for maximum planar subgraphs
Planarization and acyclic colorings of subcubic claw-free graphs
On the k-restricted structure ratio in planar and outerplanar graphs
Two new approximation algorithms for the maximum planar subgraph problem
An efficient graph planarization two‐phase heuristic
Approximation algorithms for NP-complete problems on planar graphs
Algorithm 797
Approximation algorithms for Euler genus and related problems
A simulated annealing algorithm for the maximum planar subgraph problem
Branch-and-bound techniques for the maximum planar subgraph problem^∗
scientific article; zbMATH DE number 871895 (Why is no real title available?)
Cycles to the rescue! Novel constraints to compute maximum planar subgraphs fast
A tight extremal bound on the Lovász cactus number in planar graphs
Exact algorithms for the maximum planar subgraph problem: new models and experiments
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems
scientific article; zbMATH DE number 2230213 (Why is no real title available?)
Angles of arc-polygons and lombardi drawings of cacti
An improved algorithm for finding maximum outerplanar subgraphs
Finding large planar subgraphs and large subgraphs of a given genus
A note on the maximum weight planar subgraph problem
A (1/2+1/60)-approximation algorithm for maximum weight series-parallel subgraph
Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
Analysis of the two-for-one swap heuristic for approximating the maximum independent set in a k-polymatroid
Local optimization algorithms for maximum planar subgraph
A branch-and-cut approach to the crossing number problem

This page was built for publication: A Better Approximation Algorithm for Finding Planar Subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216139)