Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2007.02.064 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2007.02.064 / rank | |||
Normal rank | |||
Latest revision as of 07:00, 10 December 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
0 references
0 references
0 references
