Constraint satisfaction problems parameterized above or below tight bounds: A survey

G Gutin, A Yeo - The Multivariate Algorithmic Revolution and Beyond … - Springer
We consider constraint satisfaction problems parameterized above or below tight bounds.
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …
被引用次数：36 相关文章

[引用][C] Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey

G Gutin, A Yeo - The Multivariate Algorithmic Revolution and Beyond, 2012 - cir.nii.ac.jp
Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey |
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォーム …

Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey

G Gutin, A Yeo - Springer
We consider constraint satisfaction problems parameterized above or below tight bounds.
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …

Constraint satisfaction problems parameterized above or below tight bounds: a survey

G Gutin, A Yeo - The Multivariate Algorithmic Revolution and Beyond …, 2012 - dl.acm.org
We consider constraint satisfaction problems parameterized above or below tight bounds.
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …

Constraint satisfaction problems parameterized above or below tight bounds: A survey

G Gutin, A Yeo - … Dedicated to Michael R. Fellows on …, 2012 - portal.findresearcher.sdu.dk
We consider constraint satisfaction problems parameterized above or below tight bounds.
One example is MaxSat parameterized above m/2: given a CNF formula F with m clauses …

[引用][C] Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey

G Gutin, A Yeo - The Multivariate Algorithmic Revolution and Beyond, 2012 - Springer