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
13
click to vote
ALGORITHMICA
2011
favorite
Email
discuss
report
174
views
Artificial Intelligence
»
more
ALGORITHMICA 2011
»
Approximability of Packing Disjoint Cycles
12 years 11 months ago
Download
webdocs.cs.ualberta.ca
Zachary Friggstad, Mohammad R. Salavatipour
Real-time Traffic
ALGORITHMICA 2011
|
Artificial Intelligence
|
claim paper
Related Content
»
Kernel Bounds for Disjoint Cycles and Disjoint Paths
»
Packing disjoint cycles over vertex cuts
»
Parameterized Approximability of the Disjoint Cycle Problem
»
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
»
On the complexity of approximating kset packing
»
Subsequence Packing Complexity Approximation and Application
»
Packing Edge Disjoint Triangles A Parameterized View
»
Maximum Flows on Disjoint Paths
»
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
more »
Post Info
More Details (n/a)
Added
12 May 2011
Updated
12 May 2011
Type
Journal
Year
2011
Where
ALGORITHMICA
Authors
Zachary Friggstad, Mohammad R. Salavatipour
Comments
(0)
Researcher Info
ALGORITHMICA 2010 Study Group
Computer Vision