Microsoft Research
Microsoft Translator |
An improved approximation algorithm for the 0-extension problem

Jittat Fakcharoenphol, Chris Harrelson, Satish Rao, and Kunal Talwar
2003

pub04-0-extension.ps
PostScript file

In  SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

Publisher  Society for Industrial and Applied Mathematics
Copyright © 2007 by Society for Industrial and Applied Mathematics.

Details

TypeInproceedings
Pages257–265
ISBN0-89871-538-5
AddressPhiladelphia, PA, USA
Share
Share this page on Facebook
Share this page on Twitter
Share this page on LinkedIn
E-mail this page
RSS feeds
> Publications > An improved approximation algorithm for the 0-extension problem