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 条
  • [21] Counting independent sets in amenable groups
    Briceno, Raimundo
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2024, 44 (04) : 958 - 1012
  • [22] Counting Maximal Antichains and Independent Sets
    L. Ilinca
    J. Kahn
    Order, 2013, 30 : 427 - 435
  • [23] Counting independent sets in regular hypergraphs
    Balogh, Jozsef
    Bollobas, Bela
    Narayanan, Bhargav
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2021, 180
  • [24] On counting independent sets in sparse graphs
    Dyer, M
    Frieze, A
    Jerrum, M
    SIAM JOURNAL ON COMPUTING, 2002, 31 (05) : 1527 - 1541
  • [25] Survey on counting maximal independent sets
    Chang, GJ
    Jou, MJ
    PROCEEDINGS OF THE SECOND ASIAN MATHEMATICAL CONFERENCE 1995, 1998, : 265 - 275
  • [26] Counting independent sets in a tolerance graph
    Lin, Min-Sheng
    Su, Sheng-Huang
    DISCRETE APPLIED MATHEMATICS, 2015, 181 : 174 - 184
  • [27] Counting independent sets in Riordan graphs
    Cheon, Gi-Sang
    Jung, Ji-Hwan
    Kang, Bumtle
    Kim, Hana
    Kim, Suh-Ryung
    Kitaev, Sergey
    Mojallal, Seyed Ahmad
    DISCRETE MATHEMATICS, 2020, 343 (11)
  • [28] Enumerating Order Types for Small Point Sets with Applications
    Oswin Aichholzer
    Franz Aurenhammer
    Hannes Krasser
    Order, 2002, 19 : 265 - 281
  • [29] Enumerating order types for small point sets with applications
    Aichholzer, O
    Aurenhammer, F
    Krasser, H
    ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 2002, 19 (03): : 265 - 281
  • [30] Models and algorithms for combinatorial optimization problems arising in railway applications
    Cacchiani, Valentina
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2009, 7 (01): : 109 - 112
12345