The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228)

From MaRDI portal
Revision as of 12:45, 20 January 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q29037496, #quickstatements; #temporary_batch_1705750702424)
scientific article
Language Label Description Also known as
English
The searching over separators strategy to solve some NP-hard problems in subexponential time
scientific article

    Statements

    The searching over separators strategy to solve some NP-hard problems in subexponential time (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    computational geometry
    0 references
    NP-hardness
    0 references
    separators strategy
    0 references
    divide-and- conquer strategy
    0 references
    traveling salesperson
    0 references

    Identifiers