Approximation algorithms for NP-complete problems on planar graphs (Q4299299): Difference between revisions

← Older edit

@@ Property / full work available at URL @@
+https://doi.org/10.1145/174644.174650
+Normal rank
@@ Property / OpenAlex ID @@
+W2156760067
@@ Property / OpenAlex ID: W2156760067 / rank @@
+Normal rank
@@ Property / DBLP publication ID @@
+journals/jacm/Baker94
@@ Property / DBLP publication ID: journals/jacm/Baker94 / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q4696139
@@ Property / Recommended article: Q4696139 / rank @@
+Normal rank
@@ Property / Recommended article: Q4696139 / qualifier @@
+Similarity Score: 0.9425925Amount 0.9425925
Unit 1
-Amount
+.9425925
 Unit
@@ Property / Recommended article: Q4696139 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q3115248
@@ Property / Recommended article: Q3115248 / rank @@
+Normal rank
@@ Property / Recommended article: Q3115248 / qualifier @@
+Similarity Score: 0.9166871Amount 0.9166871
Unit 1
-Amount
+.9166871
 Unit
@@ Property / Recommended article: Q3115248 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Parallel approximation schemes for problems on planar graphs
+Normal rank
+Similarity Score: 0.9157878Amount 0.9157878
Unit 1
-Amount
+.9157878
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Linear-time algorithms for problems on planar graphs with fixed disk dimension
+Normal rank
+Similarity Score: 0.9099657Amount 0.9099657
Unit 1
-Amount
+.9099657
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Planar graphs: Theory and algorithms
@@ Property / Recommended article: Planar graphs: Theory and algorithms / rank @@
+Normal rank
+Similarity Score: 0.9097258Amount 0.9097258
Unit 1
-Amount
+.9097258
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+STACS 2004
@@ Property / Recommended article: STACS 2004 / rank @@
+Normal rank
@@ Property / Recommended article: STACS 2004 / qualifier @@
+Similarity Score: 0.9076676Amount 0.9076676
Unit 1
-Amount
+.9076676
 Unit
@@ Property / Recommended article: STACS 2004 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Fast Sub-exponential Algorithms and Compactness in Planar Graphs
+Normal rank
+Similarity Score: 0.90574884Amount 0.90574884
Unit 1
-Amount
+.90574884
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+A Better Approximation Algorithm for Finding Planar Subgraphs
+Normal rank
+Similarity Score: 0.9051404Amount 0.9051404
Unit 1
-Amount
+.9051404
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4875164
@@ Property / Recommended article: Q4875164 / rank @@
+Normal rank
@@ Property / Recommended article: Q4875164 / qualifier @@
+Similarity Score: 0.9051404Amount 0.9051404
Unit 1
-Amount
+.9051404
 Unit
@@ Property / Recommended article: Q4875164 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4972036
@@ Property / Recommended article: Q4972036 / rank @@
+Normal rank
@@ Property / Recommended article: Q4972036 / qualifier @@
+Similarity Score: 0.90436083Amount 0.90436083
Unit 1
-Amount
+.90436083
 Unit
@@ Property / Recommended article: Q4972036 / qualifier @@
+Recommender Run: Recommender Run 2