The searching over separators strategy to solve some NP-hard problems in subexponential time (Q2366228): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/algorithmica/HwangCL93, #quickstatements; #temporary_batch_1731505720702 |
||
| (One intermediate revision by one other user not shown) | |||
| 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
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
