How easy is local search? (Q1109573)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4070340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How easy is local search? |
scientific article; zbMATH DE number 4070340 |
Statements
How easy is local search? (English)
0 references
1988
0 references
locally optimal solutions
0 references
NP-hard
0 references
combinatorial optimization
0 references
local search
0 references
graph partitioning
0 references
0.9463027715682985
0 references
0.9407666325569152
0 references
0.9131692051887512
0 references
0.8653149604797363
0 references
