Sciweavers

757 search results - page 19 / 152
» On the hardness of approximating Max-Satisfy
Sort
View
68
Voted
CORR
2008
Springer
83views Education» more  CORR 2008»
15 years 1 months ago
Drawing (Complete) Binary Tanglegrams: Hardness, Approximation, Fixed-Parameter Tractability
Kevin Buchin, Maike Buchin, Jaroslaw Byrka, Martin...
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 1 months ago
Exponential-Time Approximation of Hard Problems
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mat...
33
Voted
CORR
2007
Springer
53views Education» more  CORR 2007»
15 years 1 months ago
On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes
Andrew McGregor, Olgica Milenkovic