On the complexity of the bandpass problem

MaRDI QIDQ6140289zbMATH OpenFDO

Authors Mehmet Kurt, Hakan Kutucu, Arif Gursoy, Urfat G. Nuriyev

Publication date 22 January 2024

Full work available at URL http://www.twmsj.az/Abstract.aspx?Id=5366

zbMATH Keywords

Bandpass ProblemcomplexityNP-completeNP-hardrestrictionsatisfiability problem

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• On the bandpass problem
• The three column bandpass problem is solvable in linear time
• The bandpass problem: Combinatorial optimization and library of problems
• Bandwidth contrained NP-complete problems
• An improved approximation algorithm for the bandpass problem

This page was built for publication: On the complexity of the bandpass problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6140289)