On the bandpass problem

DOI10.1007/S10878-009-9273-2zbMath1219.90144OpenAlexW1968418363MaRDI QIDQ543512

Guo-Hui Lin

Publication date: 17 June 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9273-2

zbMATH Keywords

approximation algorithmNP-hardexact algorithmHamiltonian path problembandpass problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

Approximating the maximum multiple RNA interaction problem ⋮ A 0.5358-approximation for Bandpass-2 ⋮ Scatter search for the bandpass problem ⋮ The band collocation problem ⋮ Approximation Algorithms for the Maximum Multiple RNA Interaction Problem

Cites Work

• The bandpass problem: Combinatorial optimization and library of problems
• On Local Search for Weighted k-Set Packing
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bandpass problem