Counting and enumerating independent sets with applications to combinatorial optimization problems

被引：2
|
作者：
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 条
  • [1] Counting and enumerating independent sets with applications to combinatorial optimization problems
    Frank Gurski
    Carolin Rehs
    Mathematical Methods of Operations Research, 2020, 91 : 439 - 463
  • [2] Enumerating maximal independent sets with applications to graph colouring
    Byskov, JM
    OPERATIONS RESEARCH LETTERS, 2004, 32 (06) : 547 - 556
  • [3] Bound sets for biobjective combinatorial optimization problems
    Ehrgott, Matthias
    Gandibleux, Xavier
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (09) : 2674 - 2694
  • [4] Combinatorial Optimization Problems in Engineering Applications
    Mittelmann, Hans D.
    NUMERICAL ANALYSIS AND OPTIMIZATION, 2018, 235 : 193 - 208
  • [5] Bounds and bound sets for biobjective combinatorial optimization problems
    Ehrgott, M
    Gandibleux, X
    MULTIPLE CRITERIA DECISION MAKING IN THE NEW MILLENNIUM, 2001, 507 : 241 - 253
  • [6] Counting and Enumerating Optimum Cut Sets for Hypergraph k-Partitioning Problems for Fixed k
    Beideman, Calvin
    Chandrasekaran, Karthekeyan
    Wang, Weihang
    MATHEMATICS OF OPERATIONS RESEARCH, 2023, 49 (04) : 2579 - 2601
  • [7] Enumerating independent vertex sets in grid graphs
    Oh, Seungsang
    Lee, Sangyop
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 510 : 192 - 204
  • [8] An algorithm for counting maximum weighted independent sets and its applications
    Dahllöf, V
    Jonsson, P
    PROCEEDINGS OF THE THIRTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2002, : 292 - 298
  • [9] Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
    Chassein, Andre
    Goerigk, Marc
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 258 (01) : 58 - 69
  • [10] Counting Independent Sets in Hypergraphs
    Cooper, Jeff
    Dutta, Kunal
    Mubayi, Dhruv
    COMBINATORICS PROBABILITY & COMPUTING, 2014, 23 (04): : 539 - 550
12345