Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

FOCS
2000
IEEE

favoriteEmaildiscussreport

97views Theoretical Computer Science» more FOCS 2000»

Polynomial Time Approximation Schemes for Geometric k-Clustering

13 years 9 months ago

Polynomial Time Approximation Schemes for Geometric k-Clustering

Download www.cs.ucla.edu

Rafail Ostrovsky, Yuval Rabani

Real-time Traffic

FOCS 2000 | Theoretical Computer Science |

claim paper

Related Content

» Approximation Schemes for NodeWeighted Geometric Steiner Tree Problems

» A PolynomialTime Approximation Algorithm for a Geometric Dispersion Problem

» A fully polynomial time approximation scheme for timing driven minimum cost buffer inserti...

» A polynomial time approximation scheme for timing constrained minimum cost layer assignmen...

» A Polynomial Time Approximation Scheme for Dense MIN 2SAT

» A PTAS for a Disc Covering Problem Using WidthBounded Separators

» Fast fully polynomial approximation schemes for minimizing completion time variance

» A polynomial time approximation scheme for embedding a directed hypergraph on a ring

» Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph

Post Info
More Details (n/a)

Added	31 Jul 2010
Updated	31 Jul 2010
Type	Conference
Year	2000
Where	FOCS
Authors	Rafail Ostrovsky, Yuval Rabani

Comments (0)