When polynomial approximation meets exact computation (Q5892165): Difference between revisions

@@ Property / DOI @@
-.1007/s10288-015-0294-7
@@ Property / DOI: 10.1007/s10288-015-0294-7 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10288-015-0294-7
+Normal rank
@@ Property / OpenAlex ID @@
+W811821385
@@ Property / OpenAlex ID: W811821385 / rank @@
+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 @@
+Approximation and Online Algorithms
@@ Property / cites work: Approximation and Online Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+On approximation properties of the Independent set problem for degree 3 graphs
+Normal rank
@@ Property / cites work @@
+Exact algorithms for exact satisfiability and number of perfect matchings
+Normal rank
@@ Property / cites work @@
+Set Partitioning via Inclusion-Exclusion
@@ Property / cites work: Set Partitioning via Inclusion-Exclusion / rank @@
+Normal rank
@@ Property / cites work @@
+On subexponential and FPT-time inapproximability
@@ Property / cites work: On subexponential and FPT-time inapproximability / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential approximation schemata for some network design problems
+Normal rank
@@ Property / cites work @@
+Fast algorithms for min independent dominating set
+Normal rank
@@ Property / cites work @@
+Efficient approximation of Min Set Cover by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
+Normal rank
@@ Property / cites work @@
+Enumerating maximal independent sets with applications to graph colouring.
+Normal rank
@@ Property / cites work @@
+Exponential-time approximation of weighted set cover
+Normal rank
@@ Property / cites work @@
+Exact and approximate bandwidth
@@ Property / cites work: Exact and approximate bandwidth / rank @@
+Normal rank
@@ Property / cites work @@
+Capacitated Domination Faster Than O(2 n )
@@ Property / cites work: Capacitated Domination Faster Than O(2 n ) / rank @@
+Normal rank
@@ Property / cites work @@
+MAX SAT approximation beyond the limits of polynomial-time approximation
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating MAX SAT by moderately exponential and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Expected Computation Time for Hamiltonian Path problem
+Normal rank
@@ Property / cites work @@
+Approximating the minimum maximal independence number
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q5702337
@@ Property / cites work: Q5702337 / 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 / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for Maximum Independent Set
@@ Property / cites work: Exact Algorithms for Maximum Independent Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10288-015-0294-7
@@ Property / DOI: 10.1007/S10288-015-0294-7 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5892165