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

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Created claim: DBLP publication ID (P1635): journals/algorithmica/HwangCL93, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Ruei-Chuan Chang / rank
 
Normal rank
Property / author
 
Property / author: Richard Chia-Tung Lee / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4760292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The p-Centre Problem-Heuristic and Optimal Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rectangularp-center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / 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: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs: Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146536 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01228511 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106183852 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/algorithmica/HwangCL93 / rank
 
Normal rank

Latest revision as of 15:12, 13 November 2024

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