Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2007.02.064 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2155224464 / rank | |||
Normal rank | |||
Revision as of 21:48, 19 March 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
