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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
70
click to vote
CJ
2008
71
views
more
CJ 2008
»
Parameterized Complexity and Approximation Algorithms
15 years 3 months ago
Download
www.cs.bme.hu
Dániel Marx
Real-time Traffic
CJ 2008
|
claim paper
Related Content
»
On Parameterized Approximability
»
Approximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
»
On Exact and Approximation Algorithms for Distinguishing Substring Selection
»
Paths of Bounded Length and Their Cuts Parameterized Complexity and Algorithms
»
Parameterized Approximability of the Disjoint Cycle Problem
»
Parameterized Complexity of Generalized Vertex Cover Problems
»
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with ...
»
The Complexity of PolynomialTime Approximation
»
Constant Ratio FixedParameter Approximation of the Edge Multicut Problem
more »
Post Info
More Details (n/a)
Added
09 Dec 2010
Updated
09 Dec 2010
Type
Journal
Year
2008
Where
CJ
Authors
Dániel Marx
Comments
(0)
Researcher Info
CJ 1998 Study Group
Computer Vision