RAMSEY NUMBERS AND AN APPROXIMATION ALGORITHM FOR THE VERTEX COVER PROBLEM

被引：106

作者：

MONIEN, B

SPECKENMEYER, E

机构：

[1] Univ Paderborn, Fachbereich, Theoretische Informatik, Paderborn,, West Ger, Univ Paderborn, Fachbereich Theoretische Informatik, Paderborn, West Ger

来源：

ACTA INFORMATICA | 1985年 / 22卷 / 01期

关键词：

D O I：

10.1007/BF00290149

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：115 / 123

页数：9

共 15 条

[1] A NOTE ON RAMSEY NUMBERS [J].

AJTAI, M ;

KOMLOS, J ;

SZEMEREDI, E .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1980, 29 (03) :354-360

[2]

BARYEHUDA R, 1983, 260 TECHN HAIF TECHN

[3]

BARYEHUDA R, 1982, 14TH P ANN ACM S THE, P303

[4]

ERDOS P, 1961, MINIMAL NUMBER VERTI, P181

[5]

Erdos P., 1959, CANADIAN J MATH, V11, P34

[6]

Even S., 1979, GRAPH ALGORITHMS

[7]

FAJTLOWICZ S, 1978, C NUMER, V21, P269

[8]

Graver J. E., 1968, J COMBINATORIAL THEO, V4, P125

[9] LOWER BOUNDS ON THE INDEPENDENCE NUMBER IN TERMS OF THE DEGREES [J].

GRIGGS, JR .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 1983, 34 (01) :22-39

[10] EFFICIENT BOUNDS FOR THE STABLE SET, VERTEX COVER AND SET PACKING PROBLEMS [J].

HOCHBAUM, DS .

DISCRETE APPLIED MATHEMATICS, 1983, 6 (03) :243-254

← 1 2 →