The Kr-Packing Problem

被引：0

作者：

Venkatesan Guruswami

C. Pandu Rangan

M. S. Chang

G. J. Chang

C. K. Wong

机构：

[1] MIT Laboratory for Computer Science Cambridge,

[2] MA 01239,undefined

[3] USA venkat@theory.lcs.mit.edu,undefined

[4] Department of Computer Science and Engineering Indian Institute of Technology Madras-600 036,undefined

[5] India rangan@iitm.ernet.in,undefined

[6] Department of Computer Science and Information Engineering National Chung Cheng University Ming-Hsiun,undefined

[7] Chiayi 621 Taiwan,undefined

[8] Republic of China mschang@cs.ccu.edu.tw,undefined

[9] Department of Applied Mathematics National Chaio Tung University Hsinchu 30050 Taiwan,undefined

[10] Republic of China gjchang@math.nctu.edu.tw,undefined

[11] Department of Computer Science and Engineering Chinese University of Hong Kong,undefined

[12] Hong Kong wongck@cse.cuhk.edu.hk,undefined

来源：

Computing | 2001年 / 66卷

关键词：

AMS Subject Classifications: 05C70; 05C85; 68Q20.; Key Words: Matching; Kr-packing; Kr-factor; NP-completeness; chordal graph; split graph; cograph; line graph.;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

For a fixed integer r≥2, the Kr-packing problem is to find the maximum number of pairwise vertex-disjointKr's (complete graphs on r vertices) in a given graph. The Kr-factor problem asks for the existence of a partition of the vertex set of a graph into Kr's. The Kr-packing problem is a natural generalization of the classical matching problem, but turns out to be much harder for r≥3 – it is known that for r≥3 the Kr-factor problem is NP-complete for graphs with clique number r [16]. This paper considers the complexity of the Kr-packing problem on restricted classes of graphs.

引用

页码：79 / 89

页数：10

共 50 条

[31] ALGORITHM FOR THE VERTEX PACKING PROBLEM
VOITISHIN, YV
SHARKOVSKAYA, EA
CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (01) : 148 - 150
[32] Bin packing problem with scenarios
Bodis, Attila
Balogh, Janos
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2019, 27 (02) : 377 - 395
[33] Stochastic set packing problem
Escudero, Laureano F.
Landete, Mercedes
Rodriguez-Chia, Antonio M.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (02) : 232 - 240
[34] On the bipartite graph packing problem
Vasarhelyi, Balint
DISCRETE APPLIED MATHEMATICS, 2017, 227 : 149 - 155
[35] On the fractionality of the path packing problem
Natalia Vanetik
Journal of Combinatorial Optimization, 2012, 24 : 526 - 539
[36] On the constrained rectangle packing problem
Georgis, N.
Petrou, M.
Kittler, J.
International Journal of Modelling and Simulation, 2000, 20 (04): : 293 - 299
[37] On the online bin packing problem
Seiden, SS
JOURNAL OF THE ACM, 2002, 49 (05) : 640 - 671
[38] A cube-packing problem
Fan, Yonghui
Zhang, Yuqin
Ye, Guoyan
ARS COMBINATORIA, 2008, 87 : 353 - 358
[39] The transportation problem with packing constraints
Flamand, Tulay
Iori, Manuel
Haouari, Mohamed
COMPUTERS & OPERATIONS RESEARCH, 2023, 157
[40] The Packing While Traveling Problem
Polyakovskiy, S.
Neumann, F.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 258 (02) : 424 - 439

← 1 2 3 4 5 →