Login / Signup
Strong computational lower bounds via parameterized complexity.
Jianer Chen
Xiuzhen Huang
Iyad A. Kanj
Ge Xia
Published in:
J. Comput. Syst. Sci. (2006)
Keyphrases
</>
lower bound
parameterized complexity
cutting plane
upper bound
objective function
branch and bound algorithm
np hard
branch and bound
fixed parameter tractable
database
data management