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
34
click to vote
COCOON
2010
Springer
favorite
Email
discuss
report
153
views
Combinatorics
»
more
COCOON 2010
»
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
14 years 3 months ago
Download
www.cse.psu.edu
Piotr Berman, Marek Karpinski, Andrzej Lingas
Real-time Traffic
COCOON 2010
|
Combinatorics
|
claim paper
Related Content
»
Distributed Approximation of Capacitated Dominating Sets
»
On ColumnRestricted and Priority Covering Integer Programs
»
Weighted Geometric Set Cover via QuasiUniform Sampling
»
Geometric Set Cover and Hitting Sets for Polytopes in R3
»
Algorithms for twobox covering
»
Approximation Algorithms for Capacitated Rectangle Stabbing
»
Practical Discrete Unit Disk Cover Using an Exact LineSeparable Algorithm
»
A PTAS for a Disc Covering Problem Using WidthBounded Separators
»
A PrimalDual Approximation Algorithm for Partial Vertex Cover Making Educated Guesses
more »
Post Info
More Details (n/a)
Added
02 Aug 2010
Updated
02 Aug 2010
Type
Conference
Year
2010
Where
COCOON
Authors
Piotr Berman, Marek Karpinski, Andrzej Lingas
Comments
(0)
Researcher Info
Combinatorics Study Group
Computer Vision