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 条

[1] SYMMETRY AND APPROXIMABILITY OF SUBMODULAR MAXIMIZATION PROBLEMS
Vondrak, Jan
SIAM JOURNAL ON COMPUTING, 2013, 42 (01) : 265 - 304
[2] Symmetry and approximability of submodular maximization problems
Vondrak, Jan
2009 50TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE: FOCS 2009, PROCEEDINGS, 2009, : 651 - 670
[3] On the approximability of maximum and minimum edge clique partition problems
Dessmark, Anders
Lingas, Andrzej
Lundell, Eva-Marta
Persson, Mia
Jansson, Jesper
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2007, 18 (02) : 217 - 226
[4] On the Approximability of the Vertex Cover and Related Problems
Han, Qiaoming
Punnen, Abraham P.
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 161 - +
[5] Approximability of Clique Transversal in Perfect Graphs
Fiorini, Samuel
Krithika, R.
Narayanaswamy, N. S.
Raman, Venkatesh
ALGORITHMICA, 2018, 80 (08) : 2221 - 2239
[6] Approximability of Clique Transversal in Perfect Graphs
Samuel Fiorini
R. Krithika
N. S. Narayanaswamy
Venkatesh Raman
Algorithmica, 2018, 80 : 2221 - 2239
[7] On the approximability of covering points by lines and related problems
Dumitrescu, Adrian
Jiang, Minghui
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (09): : 703 - 717
[8] Complexity of clique coloring and related problems
Marx, Daniel
THEORETICAL COMPUTER SCIENCE, 2011, 412 (29) : 3487 - 3500
[9] Approximability issues for unconstrained and constrained maximization of half-product related functions
Kellerer, Hans
Basso, Rebecca Sarto
Strusevich, Vitaly A.
THEORETICAL COMPUTER SCIENCE, 2017, 659 : 64 - 71
[10] On the approximability and exact algorithms for vector domination and related problems in graphs
Cicalese, Ferdinando
Milanic, Martin
Vaccaro, Ugo
DISCRETE APPLIED MATHEMATICS, 2013, 161 (06) : 750 - 767

← 1 2 3 4 5 →