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
37
click to vote
WAOA
2004
Springer
favorite
Email
discuss
report
146
views
Algorithms
»
more
WAOA 2004
»
Approximation Algorithms for Mixed Fractional Packing and Covering Problems
14 years 1 months ago
Download
www.ceid.upatras.gr
Klaus Jansen
Real-time Traffic
WAOA 2004
|
claim paper
Related Content
»
Fast Approximation Algorithms for Fractional Packing and Covering Problems
»
An Approximation Algorithm for the General Mixed Packing and Covering Problem
»
Distributed algorithms for covering packing and maximum weighted matching
»
New approaches to covering and packing problems
»
Sequential and Parallel Algorithms for Mixed Packing and Covering
»
Online PrimalDual Algorithms for Covering and Packing Problems
»
Weighted Geometric Set Cover via QuasiUniform Sampling
»
Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problem...
»
Better approximation algorithms for bin covering
more »
Post Info
More Details (n/a)
Added
02 Jul 2010
Updated
02 Jul 2010
Type
Conference
Year
2004
Where
WAOA
Authors
Klaus Jansen
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision