Counting and enumerating independent sets with applications to combinatorial optimization problems

被引：3
|
作者：
Gurski, Frank [1 ]
Rehs, Carolin [1 ]
机构：
[1] Univ Dusseldorf, Inst Comp Sci, Algorithm Hard Problems Grp, D-40225 Dusseldorf, Germany
来源：
MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 2020年 / 91卷 / 03期
关键词：
Knapsack problem; Multidimensional knapsack problem; Threshold graphs; Independent sets; KNAPSACK-PROBLEMS; GRAPHS; ALGORITHMS; COMPLEXITY; CONFLICT;
D O I：
10.1007/s00186-019-00696-4
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
Counting and enumerating maximal and maximum independent sets are well-studied problems in graph theory. In this paper we introduce methods to count and enumerate maximal/maximum independent sets in threshold graphs andk-threshold graphs and improve former results for these problems. The results can be applied to combinatorial optimization problems, and in particular to different variations of the knapsack problem. As feasible solutions for instances of those problems correspond to independent sets in threshold graphs andk-threshold graphs, we obtain polynomial time results for special knapsack and multidimensional knapsack instances. Also, we show lower and upper bounds for the number of necessary bins in several bin packing problems.
引用
收藏
页码：439 / 463
页数：25
相关论文
共 50 条
  • [11] Counting independent sets in graphs
    Samotij, Wojciech
    EUROPEAN JOURNAL OF COMBINATORICS, 2015, 48 : 5 - 18
  • [12] Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
    Boekler, Fritz
    Mutzel, Petra
    ALGORITHMS - ESA 2015, 2015, 9294 : 288 - 299
  • [13] Combinatorial optimization problems related to the committee polyhedral separability of finite sets
    Vl. D. Mazurov
    M. Yu. Khachay
    M. I. Poberii
    Proceedings of the Steklov Institute of Mathematics, 2008, 263 : 93 - 107
  • [14] Combinatorial Optimization Problems Related to the Committee Polyhedral Separability of Finite Sets
    Mazurov, Vl. D.
    Khachay, M. Yu.
    Poberii, M. I.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2008, 263 (Suppl 2) : S93 - S107
  • [15] Combinatorial optimization problems related to the committee polyhedral separability of finite sets
    Mazurov, V. D.
    Khachai, M. Yu.
    Poberii, M. I.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2008, 14 (02): : 89 - 102
  • [16] PROPERTIES OF COMBINATORIAL OPTIMIZATION PROBLEMS OVER POLYHEDRAL-SPHERICAL SETS
    Yakovlev, S. V.
    Pichugina, O. S.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2018, 54 (01) : 99 - 109
  • [17] Enumerating Minimal Solution Sets for Metric Graph Problems
    Bergougnoux, Benjamin
    Defrain, Oscar
    Mc Inerney, Fionn
    ALGORITHMICA, 2025,
  • [18] Counting independent sets in tricyclic graphs
    Poureidi, Abolfazl
    DISCRETE APPLIED MATHEMATICS, 2023, 331 : 138 - 146
  • [19] Counting independent sets in cocomparability graphs
    Dyer, Martin
    Mueller, Haiko
    INFORMATION PROCESSING LETTERS, 2019, 144 : 31 - 36
  • [20] Counting Maximal Antichains and Independent Sets
    Ilinca, L.
    Kahn, J.
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2013, 30 (02): : 427 - 435
12345