Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516): Difference between revisions

@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-44543-4_26
+Normal rank
@@ Property / OpenAlex ID @@
+W2537735054
@@ Property / OpenAlex ID: W2537735054 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
+Normal rank
@@ Property / cites work @@
+A Better Approximation Algorithm for Finding Planar Subgraphs
+Normal rank
@@ Property / cites work @@
+Q3139516
@@ Property / cites work: Q3139516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886062
@@ Property / cites work: Q4886062 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of heuristics for finding a maximum weight planar subgraph
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Q3866146
@@ Property / cites work: Q3866146 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3615285
@@ Property / cites work: Q3615285 / rank @@
+Normal rank
@@ Property / cites work @@
+A new planarity test
@@ Property / cites work: A new planarity test / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2819516