On the approximability of clique and related maximization problems

被引：13

作者：

Srinivasan, A

机构：

[1] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA

[2] Univ Maryland, Inst Adv Comp Studies, College Pk, MD 20742 USA

[3] Bell Labs, Lucent Technol, Holmdel, NJ 07733 USA

来源：

JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2003年 / 67卷 / 03期

关键词：

inapproximability; approximation algorithms; clique; independent set; packing integer programs; random sampling;

D O I：

10.1016/S0022-0000(03)00110-7

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

We consider approximations of the form n(1-o(1)) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the "o(1)" term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results. (C) 2003 Published by Elsevier Inc.

引用

页码：633 / 651

页数：19

共 50 条

[21] THE APPROXIMABILITY OF PROBLEMS COMPLETE FOR P
SERNA, M
SPIRAKIS, P
OPTIMAL ALGORITHMS, 1989, 401 : 193 - 204
[22] On the approximability of combinatorial exchange problems
Babaioff, Moshe
Briest, Patrick
Krysta, Piotr
ALGORITHMIC GAME THEORY, PROCEEDINGS, 2008, 4997 : 83 - +
[23] THE APPROXIMABILITY OF PROBLEMS COMPLETE FOR P
SERNA, M
SPIRAKIS, P
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 401 : 193 - 204
[24] Parameterized (in)approximability of subset problems
Bonnet, Edouard
Paschos, Vangelis Th.
OPERATIONS RESEARCH LETTERS, 2014, 42 (03) : 222 - 225
[25] On the Approximability of Some Haplotyping Problems
Abraham, John
Chen, Zhixiang
Fowler, Richard
Fu, Bin
Zhu, Binhai
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2009, 5564 : 3 - +
[26] The approximability of constraint satisfaction problems
Khanna, S
Sudan, M
Trevisan, L
Williamson, DP
SIAM JOURNAL ON COMPUTING, 2001, 30 (06) : 1863 - 1920
[27] The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems
Marc Demange
Vangelis Th. Paschos
Computational Optimization and Applications, 1997, 7 : 307 - 324
[28] On the approximability of Dense Steiner Problems
Hauptmann, Mathias
JOURNAL OF DISCRETE ALGORITHMS, 2013, 21 : 41 - 51
[29] THE APPROXIMABILITY BEHAVIOR OF SOME COMBINATORIAL PROBLEMS WITH RESPECT TO THE APPROXIMABILITY OF A CLASS OF MAXIMUM INDEPENDENT SET PROBLEMS
DEMANGE, M
PASCHOS, VT
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1995, 321 (05): : 645 - 648
[30] The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
Demange, M
Paschos, VT
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 7 (03) : 307 - 324

← 1 2 3 4 5 →