Sciweavers

1161 search results - page 7 / 233

» Approximation schemes for clustering problems

97

Voted

EOR
2008

123views more EOR 2008»

An asymptotic approximation scheme for the concave cost bin packing problem

15 years 1 months ago

An asymptotic approximation scheme for the concave cost bin packing problem

Download repository.lib.polyu.edu.hk

Joseph Y.-T. Leung, Chung-Lun Li

claim paper

Read More »

91

TALG
2008

39views more TALG 2008»

Faster approximation schemes for fractional multicommodity flow problems

15 years 1 months ago

$Faster approximation schemes for fractional multicommodity flow problems$

Download www.optimization-online.org

George Karakostas

claim paper

Read More »

91

Voted

ACTA
2004

102views more ACTA 2004»

Approximation schemes for the Min-Max Starting Time Problem

15 years 1 months ago

Approximation schemes for the Min-Max Starting Time Problem

Download math.haifa.ac.il

Leah Epstein, Tamir Tassa

claim paper

Read More »

94

Voted

SODA
2000
ACM

125views Algorithms» more SODA 2000»

Approximation algorithms for projective clustering

15 years 3 months ago

Approximation algorithms for projective clustering

Download biogeometry.duke.edu

We consider the following two instances of the projective clustering problem: Given a set

Pankaj K. Agarwal, Cecilia Magdalena Procopiuc

claim paper

Read More »

84

STOC
2002
ACM

103views Algorithms» more STOC 2002»

Approximate clustering via core-sets

16 years 2 months ago

Approximate clustering via core-sets

Download valis.cs.uiuc.edu

In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...

Mihai Badoiu, Sariel Har-Peled, Piotr Indyk

claim paper

Read More »

« Prev « First page 7 / 233 Last » Next »