Sciweavers

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

91

Voted

ALGORITHMICA
2004

88views more ALGORITHMICA 2004»

Approximating Min Sum Set Cover

15 years 3 months ago

Approximating Min Sum Set Cover

Download www.cs.elte.hu

Uriel Feige, László Lovász, P

Real-time Traffic

ALGORITHMICA 2004 |

claim paper

Related Content

» A Constant Factor Approximation Algorithm for Generalized MinSum Set Cover

» Preemptive and NonPreemptive Generalized Min Sum Set Cover

» On the approximation of Min Splitcoloring and Min Cocoloring

» Min sum clustering with penalties

» Small Space Representations for Metric MinSum k Clustering and Their Applications

» A MinMax Relation on Packing Feedback Vertex Sets

» An Approximation Algorithm for the Minimum Latency Set Cover Problem

» On Approximating Restricted Cycle Covers

» A Derandomization Using MinWise Independent Permutations

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ALGORITHMICA
Authors	Uriel Feige, László Lovász, Prasad Tetali

Comments (0)