Approximating the \(k\)-set packing problem by local improvements (Q3195350)
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 6495572
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the \(k\)-set packing problem by local improvements |
scientific article; zbMATH DE number 6495572 |
Statements
Approximating the $$k$$-Set Packing Problem by Local Improvements (English)
0 references
16 October 2015
0 references
\(k\)-set packing
0 references
tail change
0 references
local improvement
0 references
color coding
0 references
0.8630841374397278
0 references
0.8630841374397278
0 references
0.862959623336792
0 references
0.85372394323349
0 references
