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
23
click to vote
CATS
2006
favorite
Email
discuss
report
74
views
Applied Computing
»
more
CATS 2006
»
Greedy algorithms for on-line set-covering and related problems
13 years 11 months ago
Download
crpit.com
Giorgio Ausiello, Aristotelis Giannakos, Vangelis
Real-time Traffic
CATS 2006
|
CATS 2007
|
claim paper
Related Content
»
The Pipelined Set Cover Problem
»
Efficient and Effective Practical Algorithms for the SetCovering Problem
»
ARIES A Rearrangeable Inexpensive EdgeBased OnLine Steiner Algorithm
»
Comparing SetCovering Strategies for Optimal Corpus Design
»
Tight Results on Minimum Entropy Set Cover
»
The Power of Priority Algorithms for Facility Location and Set Cover
»
PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
»
Analysis of Approximation Algorithms for kSet Cover Using FactorRevealing Linear Programs
»
Competitive Complexity of Mobile Robot onLine Motion Planning Problems
»
Crawling Deep Web Using a New Set Covering Algorithm
more »
Post Info
More Details (n/a)
Added
30 Oct 2010
Updated
30 Oct 2010
Type
Conference
Year
2006
Where
CATS
Authors
Giorgio Ausiello, Aristotelis Giannakos, Vangelis Th. Paschos
Comments
(0)
Researcher Info
Applied Computing Study Group
Computer Vision