| Title | A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria |
| Publication Type | Conference Papers |
| Year of Publication | 1997 |
| Authors | Srinivasan A, Teo C-P |
| Conference Name | Proceedings of the twenty-ninth annual ACM symposium on Theory of computing |
| Date Published | 1997/// |
| Publisher | ACM |
| Conference Location | New York, NY, USA |
| ISBN Number | 0-89791-888-6 |
| Keywords | Approximation algorithms, covering integer programs, discrete ham-sandwich theorems, Linear programming, packet routing, randomized algorithms, Randomized rounding, rounding theorems |
| URL | http://doi.acm.org/10.1145/258533.258658 |
| DOI | 10.1145/258533.258658 |
