On a minimum linear classification problem
From MaRDI portal
Publication:5920647
DOI10.1007/s10898-005-8465-2zbMath1099.94012OpenAlexW2077135746WikidataQ60402833 ScholiaQ60402833MaRDI QIDQ5920647
Hongwei David Du, Xiao-Hua Jia, Bing Lu, Binhai Zhu, Yin-Feng Xu
Publication date: 26 September 2006
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-005-8465-2
Detection theory in information and communication theory (94A13) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for hitting objects with straight lines
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- On the complexity of locating linear facilities in the plane
- Efficient Algorithms for Geometric Graph Search Problems
- A Greedy Heuristic for the Set-Covering Problem
- Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference