Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

MFCS
2004
Springer

favoriteEmaildiscussreport

89views Theoretical Computer Science» more MFCS 2004»

Polynomial Time Approximation Schemes and Parameterized Complexity

13 years 10 months ago

Polynomial Time Approximation Schemes and Parameterized Complexity

Download faculty.cs.tamu.edu

Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Real-time Traffic

MFCS 2004 |

claim paper

Related Content

» The Complexity of PolynomialTime Approximation

» On Parameterized Exponential Time Complexity

» Approximability and parameterized complexity of minmax values

» Ruling Out PolynomialTime Approximation Schemes for Hard Constraint Satisfaction Problems

» On Approximating Optimal Weighted Lobbying and Frequency of Correctness Versus AverageCase...

» Parameterized Approximability of the Disjoint Cycle Problem

» Hybrid rounding techniques for knapsack problems

» Approximating MinMax Regret Versions of Some Polynomial Problems

» Bidimensionality and Kernels

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	MFCS
Authors	Jianer Chen, Xiuzhen Huang, Iyad A. Kanj, Ge Xia

Comments (0)