Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems (Q818673)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems |
scientific article; zbMATH DE number 5013754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems |
scientific article; zbMATH DE number 5013754 |
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
0.994629204273224
0 references
0.8410501480102539
0 references
0.8371564745903015
0 references
0.8033933043479919
0 references
