Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474)
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: Faster and simpler approximation algorithms for mixed packing and covering problems |
scientific article; zbMATH DE number 5161893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster and simpler approximation algorithms for mixed packing and covering problems |
scientific article; zbMATH DE number 5161893 |
Statements
Faster and simpler approximation algorithms for mixed packing and covering problems (English)
0 references
6 June 2007
0 references
approximation algorithm
0 references
linear and convex programming
0 references
optimization
0 references
packing and covering problem
0 references
Lagrangian decomposition
0 references
logarithmic potential
0 references
0 references
0 references
0 references
0 references
0.9447678327560424
0 references
0.9202491641044616
0 references
0.8822903633117676
0 references
