Complexity results on a paint shop problem. (Q1427181): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q2466025 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Peter Oertel / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0166-218x(03)00442-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037461057 / rank | |||
Normal rank | |||
Latest revision as of 09:21, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity results on a paint shop problem. |
scientific article |
Statements
Complexity results on a paint shop problem. (English)
0 references
14 March 2004
0 references
Dynamic programming
0 references
NP-completeness
0 references
Paint shop
0 references
Sequencing
0 references
