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

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10288-015-0294-7 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the Independent set problem for degree 3 graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subexponential and FPT-time inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential approximation schemata for some network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for min independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential-time approximation of weighted set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Domination Faster Than O(2 n ) / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX SAT approximation beyond the limits of polynomial-time approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The PCP theorem by gap amplification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating MAX SAT by moderately exponential and parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected Computation Time for Hamiltonian Path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minimum maximal independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10288-015-0294-7 / rank
 
Normal rank

Latest revision as of 19:24, 9 December 2024

scientific article; zbMATH DE number 6482995
Language Label Description Also known as
English
When polynomial approximation meets exact computation
scientific article; zbMATH DE number 6482995

    Statements

    When polynomial approximation meets exact computation (English)
    0 references
    0 references
    17 September 2015
    0 references
    complexity
    0 references
    polynomial approximation
    0 references
    exact algorithm
    0 references
    moderately exponential approximation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers