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
25
click to vote
STACS
2012
Springer
favorite
Email
discuss
report
234
views
Theoretical Computer Science
»
more
STACS 2012
»
Preemptive and Non-Preemptive Generalized Min Sum Set Cover
12 years 6 months ago
Download
www.cs.illinois.edu
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
Real-time Traffic
STACS 2012
|
Theoretical Computer Science
|
claim paper
Related Content
»
A Constant Factor Approximation Algorithm for Generalized MinSum Set Cover
more »
Post Info
More Details (n/a)
Added
25 Apr 2012
Updated
25 Apr 2012
Type
Journal
Year
2012
Where
STACS
Authors
Sungjin Im, Maxim Sviridenko, Ruben van der Zwaan
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision