Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster and simpler approximation algorithms for mixed packing and covering problems |
scientific article |
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
