The three column bandpass problem is solvable in linear time

DOI10.1016/J.TCS.2010.09.018MaRDI QIDQ620937zbMATH OpenOpenAlexFDO

Authors Zhong Li, Guohui Lin

Publication date 2 February 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.09.018

zbMATH Keywords

exact algorithmbandpass problempolynomial time solvable

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Network design and communication in computer systems (68M10)

Recommendations

• On the bandpass problem
• The bandpass problem: Combinatorial optimization and library of problems
• An improved approximation algorithm for the bandpass problem
• A 0.5358-approximation for Bandpass-2
• An improved approximation algorithm for the bandpass-2 problem

Cites work

• The bandpass problem: Combinatorial optimization and library of problems

Cited in

(6)

• Mathematical models of the bandpass problem and OrderMatic computer game
• The bandpass problem: Combinatorial optimization and library of problems
• On the complexity of the bandpass problem
• The band collocation problem
• On the bandpass problem
• Scatter search for the bandpass problem

This page was built for publication: The three column bandpass problem is solvable in linear time

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