Covering symmetric supermodular functions by graphs

被引：0

作者：

András A. Benczúr

András Frank

机构：

[1] Computer and Automation Institute,

[2] Hungarian Academy of Sciences,undefined

[3] and Department of Operations Research,undefined

[4] Eötvös University,undefined

[5] Budapest,undefined

[6] e-mail: benczur@cs.elte.hu,undefined

[7] Department of Operations Research,undefined

[8] Eötvös University,undefined

[9] Rákóczi út 5,undefined

[10] Budapest,undefined

[11] Hungary,undefined

[12] H-1088 and Ericsson Traffic Laboratory,undefined

[13] Laborc u.1. Budapest,undefined

[14] Hungary,undefined

[15] H-1037,undefined

[16] e-mail: frank@cs.elte.hu,undefined

来源：

Mathematical Programming | 1999年 / 84卷

关键词：

Mathematics Subject Classification (1991): 05C70, 90C27;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The minimum number of edges of an undirected graph covering a symmetric, supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation.

引用

页码：483 / 503

页数：20

共 50 条

[1] Covering symmetric supermodular functions by graphs
Benczúr, AA
Frank, A
MATHEMATICAL PROGRAMMING, 1999, 84 (03) : 483 - 503
[2] Covering symmetric supermodular functions by uniform hypergraphs
Király, T
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2004, 91 (02) : 185 - 200
[3] A Survey on Covering Supermodular Functions
Frank, Andras
Kiraly, Tamas
RESEARCH TRENDS IN COMBINATORIAL OPTIMIZATION, 2009, : 87 - 126
[4] Covering symmetric supermodular functions with graph edges: A short proof of a theorem of Benczur and Frank
Bernath, Attila
INFORMATION PROCESSING LETTERS, 2017, 128 : 49 - 53
[5] Partition constrained covering of a symmetric crossing supermodular function by a graph
Bernath, Attila
Grappe, Roland
Szigeti, Zoltan
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 1512 - +
[6] PARTITION CONSTRAINED COVERING OF A SYMMETRIC CROSSING SUPERMODULAR FUNCTION BY A GRAPH
Bernath, Attila
Grappe, Roland
Szigeti, Zoltan
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (01) : 335 - 382
[7] The even split rule for (concave) symmetric supermodular functions
Jia, Hao
ECONOMICS LETTERS, 2020, 186
[8] Covering skew-supermodular functions by hypergraphs of minimum total size
Bernath, Attila
Kiraly, Tamas
OPERATIONS RESEARCH LETTERS, 2009, 37 (05) : 345 - 350
[9] Zeta functions of weighted graphs and covering graphs
Horton, Matthew D.
Stark, H. M.
Terras, Audrey A.
ANALYSIS ON GRAPHS AND ITS APPLICATIONS, 2008, 77 : 29 - +
[10] STOCHASTIC COMPARISONS OF SYMMETRIC SUPERMODULAR FUNCTIONS OF HETEROGENEOUS RANDOM VECTORS
Di Crescenzo, Antonio
Frostig, Esther
Pellerey, Franco
JOURNAL OF APPLIED PROBABILITY, 2013, 50 (02) : 464 - 474

← 1 2 3 4 5 →