Share this page
Share this page E-mail this page Print this page RSS feeds
Home > Publications > An improved approximation algorithm for the 0-extension problem
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

Type: Inproceedings
Pages: 257–265
ISBN: 0-89871-538-5
Address: Philadelphia, PA, USA