Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-004-1145-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2106457067 / rank | |||
Normal rank | |||
Latest revision as of 22:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems |
scientific article |
Statements
Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (English)
0 references
21 March 2006
0 references
vertex cover
0 references
maximum independent set
0 references
