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
28
click to vote
DISOPT
2007
favorite
Email
discuss
report
104
views
more
DISOPT 2007
»
Approximation of the Quadratic Set Covering problem
13 years 11 months ago
Download
hal.archives-ouvertes.fr
Bruno Escoffier, Peter L. Hammer
Real-time Traffic
DISOPT 2007
|
claim paper
Related Content
»
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Pr...
»
Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation
»
PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
»
Approximation Algorithms for Partial Covering Problems
»
On the PositiveNegative Partial Set Cover problem
»
Fast distributed approximation algorithms for vertex cover and set cover in anonymous netw...
»
An Approximation Algorithm for the Minimum Latency Set Cover Problem
»
Robust Solutions of Uncertain Quadratic and ConicQuadratic Problems
»
Approximating node connectivity problems via set covers
more »
Post Info
More Details (n/a)
Added
13 Dec 2010
Updated
13 Dec 2010
Type
Journal
Year
2007
Where
DISOPT
Authors
Bruno Escoffier, Peter L. Hammer
Comments
(0)
Researcher Info
DISOPT 2010 Study Group
Computer Vision