A weighted version of the jump number problem on two-dimensional orders is NP-complete (Q1404375)
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 1968898
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A weighted version of the jump number problem on two-dimensional orders is NP-complete |
scientific article; zbMATH DE number 1968898 |
Statements
A weighted version of the jump number problem on two-dimensional orders is NP-complete (English)
0 references
21 August 2003
0 references
jump number
0 references
dimension
0 references
maximal independent set
0 references
NP-completeness
0 references
two-dimensional orders
0 references
0.7865467071533203
0 references
0.7815527319908142
0 references
0.7800964117050171
0 references
0.7590765357017517
0 references
0.7470280528068542
0 references
