Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2004.03.021
@@ Property / DOI: 10.1016/j.ejor.2004.03.021 / rank @@
-Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3221758
@@ Property / cites work: Q3221758 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating maximum independent sets by excluding subgraphs
+Normal rank
@@ Property / cites work @@
+A Greedy Heuristic for the Set-Covering Problem
@@ Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for christofides' traveling salesman heuristic
+Normal rank
@@ Property / cites work @@
+Improved approximations for maximum independent set via approximation chains
+Normal rank
@@ Property / cites work @@
+Q4535019
@@ Property / cites work: Q4535019 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximations of Weighted Independent Set and Hereditary Subset Problems
+Normal rank
@@ Property / cites work @@
+Q3002852
@@ Property / cites work: Q3002852 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
+Normal rank
@@ Property / cites work @@
+Q4130999
@@ Property / cites work: Q4130999 / rank @@
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Ramsey numbers and an approximation algorithm for the vertex cover problem
+Normal rank
@@ Property / cites work @@
+On the approximability of the traveling salesman problem (extended abstract)
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The Traveling Salesman Problem with Distances One and Two
+Normal rank
@@ Property / cites work @@
+Q4527015
@@ Property / cites work: Q4527015 / rank @@
+Normal rank
@@ Property / cites work @@
+P-Complete Approximation Problems
@@ Property / cites work: P-Complete Approximation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for metric facility location and             <i>k</i>             -Median problems using the primal-dual schema and Lagrangian relaxation
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2004.03.021
@@ Property / DOI: 10.1016/J.EJOR.2004.03.021 / rank @@
+Normal rank