On the complexity of approximating the independent set problem (Q5096160): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/BFb0028990 / rank
Normal rank
 
Property / author
 
Property / author: Georg Schnitger / rank
Normal rank
 
Property / author
 
Property / author: Georg Schnitger / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a unified approach for the classification of NP-complete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Some Problems on Subsequences and Supersequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non deterministic polynomial optimization problems and their approximations / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0028990 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1510300750 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/BFB0028990 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:54, 30 December 2024

scientific article; zbMATH DE number 7571933
Language Label Description Also known as
English
On the complexity of approximating the independent set problem
scientific article; zbMATH DE number 7571933

    Statements

    On the complexity of approximating the independent set problem (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    feasible solution
    0 references
    approximation algorithm
    0 references
    maximization problem
    0 references
    combinatorial optimization problem
    0 references
    polynomial-time approximation scheme
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references