Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673)

From MaRDI portal
Revision as of 12:06, 30 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
scientific article

    Statements

    Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 March 2006
    0 references
    vertex cover
    0 references
    maximum independent set
    0 references

    Identifiers

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