Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705)
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: Partial degree bounded edge packing problem for graphs and k-uniform hypergraphs |
scientific article; zbMATH DE number 6641532
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs |
scientific article; zbMATH DE number 6641532 |
Statements
Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (English)
0 references
20 October 2016
0 references
edge-packing problems
0 references
approximation algorithm
0 references
iterative rounding
0 references
Lagrangian relaxation
0 references
0 references
0.9191628098487854
0 references
0.8767307996749878
0 references
0.8725561499595642
0 references
0.8214879035949707
0 references
0.7844399809837341
0 references
