A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria (Q2719123)
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: A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria |
scientific article; zbMATH DE number 1608787
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria |
scientific article; zbMATH DE number 1608787 |
Statements
21 June 2001
0 references
packet routing
0 references
approximation algorithms
0 references
linear programming
0 references
multicommodity flow
0 references
rounding theorems
0 references
randomized algorithms
0 references
covering integer programs
0 references
randomized rounding
0 references
discrete ham-sandwich theorems
0 references
A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria (English)
0 references
