Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
An improved approximation algorithm for the 0-extension problem

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

Details

Publication typeInproceedings
Published inSODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Pages257–265
ISBN0-89871-538-5
AddressPhiladelphia, PA, USA
PublisherSociety for Industrial and Applied Mathematics
> Publications > An improved approximation algorithm for the 0-extension problem