An improved approximation algorithm for the bandpass problem

DOI10.1007/978-3-642-29700-7_32MaRDI QIDQ2898009zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Weitian Tong, Randy Goebel, Wei Ding, Guohui Lin

Publication date 16 July 2012

Published in Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_32

zbMATH Keywords

approximation algorithmedge coloringmaximum weight matchingworst-case performance ratiobandpass problem

Mathematics Subject Classification ID

Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

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

Cited in

(10)

• Mathematical models of the bandpass problem and OrderMatic computer game
• The bandpass problem: Combinatorial optimization and library of problems
• The three column bandpass problem is solvable in linear time
• On the complexity of the bandpass problem
• Direct approach to the band completion problem
• An improved version of Papoulis-Gerchberg algorithm on band-limited extrapolation
• A 0.5358-approximation for Bandpass-2
• On the bandpass problem
• Scatter search for the bandpass problem
• An improved approximation algorithm for the bandpass-2 problem

This page was built for publication: An improved approximation algorithm for the bandpass problem

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