Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
13
click to vote
SODA
2010
ACM
favorite
Email
discuss
report
397
views
Algorithms
»
more
SODA 2010
»
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
14 years 1 months ago
Download
www.cs.cmu.edu
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw
Real-time Traffic
Constant Factor Approximation
|
Discrete Algorithms
|
SODA 2010
|
claim paper
Related Content
»
Small Space Representations for Metric MinSum k Clustering and Their Applications
»
ConstantFactor Approximation for MinimumWeight Connected Dominating Sets in Unit Disk Grap...
»
Constant factor approximation algorithm for the knapsack median problem
»
Interactive Submodular Set Cover
»
Decomposing Coverings and the Planar Sensor Cover Problem
»
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
»
Distributed Approximation of Capacitated Dominating Sets
»
MinimumWeight Cycle Covers and Their Approximability
»
Polynomial time approximation schemes for minimum disk cover problems
more »
Post Info
More Details (n/a)
Added
01 Mar 2010
Updated
02 Mar 2010
Type
Conference
Year
2010
Where
SODA
Authors
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision