An improved lower bound for approximating the Minimum Integral Solution Problem with Preprocessing over norm

被引：0

作者：

Chen, Wenbin ^{[1
,2
,3
]}

Peng, Lingxi ^{[1
]}

Wang, Jianxiong ^{[1
]}

Li, Fufang ^{[1
]}

Tang, Maobin ^{[1
]}

Xiong, Wei ^{[1
]}

Wang, Songtao ^{[4
]}

机构：

[1] Guangzhou Univ, Dept Comp Sci, Guangzhou, Guangdong, Peoples R China

[2] Fudan Univ, Shanghai Key Lab Intelligent Informat Proc, Shanghai 200433, Peoples R China

[3] Nanjing Univ, State Key Lab Novel Software Technol, Nanjing 210008, Jiangsu, Peoples R China

[4] S China Normal Univ, Guangzhou, Guangdong, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2015年 / 30卷 / 03期

基金：

中国国家自然科学基金;

关键词：

Minimum Integral Solution Problem; Computational complexity; NP-hardness; PCP; CLOSEST VECTOR PROBLEM; CODING PROBLEMS; HARDNESS; INAPPROXIMABILITY; LATTICE; CODES;

D O I：

10.1007/s10878-013-9646-4

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, we study the approximation complexity of the Minimum Integral Solution Problem with Preprocessing introduced by Alekhnovich et al. (FOCS, pp. 216-225, 2005). We show that the Minimum Integral Solution Problem with Preprocessing over norm () is NP-hard to approximate to within a factor of unless This improves on the best previous result. The best result so far gave factor hardness for any epsilon > 0.

引用

页码：447 / 455

页数：9

共 50 条

[31] An Extragradient Method for Finding Minimum-Norm Solution of the Split Equilibrium Problem
Anh T.V.
[J]. Acta Mathematica Vietnamica, 2017, 42 (4) : 587 - 604
[32] A GRADIENT ALGORITHM FOR FINDING MINIMUM-NORM SOLUTION OF THE SPLIT FEASIBILITY PROBLEM
Qu, Biao
Liu, Binghua
[J]. PACIFIC JOURNAL OF OPTIMIZATION, 2017, 13 (02): : 355 - 364
[33] Improved lower bound for the complexity of unique shortest vector problem
Baolong Jin
Rui Xue
[J]. Cybersecurity, 6
[34] An improved lower bound for a bi-criteria scheduling problem
Yan, Jin
[J]. OPERATIONS RESEARCH LETTERS, 2008, 36 (01) : 57 - 60
[35] An improved lower bound for multicolor Ramsey numbers and a problem of Erdos
Sawin, Will
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2022, 188
[36] Improved lower bound for the complexity of unique shortest vector problem
Jin, Baolong
Xue, Rui
[J]. CYBERSECURITY, 2023, 6 (01)
[37] An improved lower bound on approximation algorithms for the Closest Substring problem
Wang, Jianxin
Chen, Jianer
Huang, Min
[J]. INFORMATION PROCESSING LETTERS, 2008, 107 (01) : 24 - 28
[38] AN IMPROVED ASSIGNMENT LOWER BOUND FOR THE EUCLIDEAN TRAVELING SALESMAN PROBLEM
STEWART, WR
[J]. OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 55 - 60
[39] WAY TO FIND A LOWER BOUND FOR MINIMAL SOLUTION OF COVERING PROBLEM
DU, MW
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (03) : 317 - &
[40] A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem
Mrad, Mehdi
Harrabi, Olfa
Siala, Jouhaina Chaouachi
Gharbi, Anis
[J]. IEEE ACCESS, 2020, 8 : 57891 - 57904

← 1 2 3 4 5 →