Constant factor approximation algorithms for the densest k-subgraph problem on proper interval graphs and bipartite permutation graphs

被引：7
|
作者：
Backer, Jonathan [1 ]
Keil, J. Mark [1 ]
机构：
[1] Univ Saskatchewan, Dept Comp Sci, Saskatoon, SK S7N 5C9, Canada
来源：
INFORMATION PROCESSING LETTERS | 2010年 / 110卷 / 16期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Densest subgraph; Proper interval graph; Bipartite permutation graph; Approximation algorithms;
D O I：
10.1016/j.ipl.2010.05.011
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The densest k-subgraph problem asks for a k-vertex subgraph with the maximum number of edges. This problem is NP-hard on bipartite graphs, chordal graphs, and planar graphs. A 3-approximation algorithm is known for chordal graphs. We present 3/2-approximation algorithms for proper interval graphs and bipartite permutation graphs. The latter result relies on a new characterisation of bipartite permutation graphs which may be of independent interest. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：635 / 638
页数：4
相关论文
共 27 条
  • [1] A constant approximation algorithm for the densest k-subgraph problem on chordal graphs
    Liazi, Maria
    Milis, Ioannis
    Zissimopoulos, Vassilis
    INFORMATION PROCESSING LETTERS, 2008, 108 (01) : 29 - 32
  • [2] PTAS for Densest k-Subgraph in Interval Graphs
    Nonner, Tim
    ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 631 - 641
  • [3] Densest k-Subgraph Approximation on Intersection Graphs
    Chen, Danny Z.
    Fleischer, Rudolf
    Li, Jian
    APPROXIMATION AND ONLINE ALGORITHMS, 2011, 6534 : 83 - 93
  • [4] The densest k-subgraph problem on clique graphs
    Liazi, Maria
    Milis, Ioannis
    Pascual, Fanny
    Zissimopoulos, Vassilis
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2007, 14 (04) : 465 - 474
  • [5] The densest k-subgraph problem on clique graphs
    Maria Liazi
    Ioannis Milis
    Fanny Pascual
    Vassilis Zissimopoulos
    Journal of Combinatorial Optimization, 2007, 14 : 465 - 474
  • [6] On solving the densest k-subgraph problem on large graphs
    Sotirov, Renata
    OPTIMIZATION METHODS & SOFTWARE, 2020, 35 (06): : 1160 - 1178
  • [7] Exact and superpolynomial approximation algorithms for the DENSEST K-SUBGRAPH problem
    Bourgeois, Nicolas
    Giannakos, Aristotelis
    Lucarelli, Giorgio
    Milis, Ioannis
    Paschos, Vangelis Th.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (03) : 894 - 903
  • [8] Induced Subgraph Isomorphism on proper interval and bipartite permutation graphs
    Heggernes, Pinar
    van 't Hof, Pim
    Meister, Daniel
    Villanger, Yngve
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 252 - 269
  • [9] The Densest k Subgraph Problem in b-Outerplanar Graphs
    Gonzales, Sean
    Migler, Theresa
    COMPLEX NETWORKS AND THEIR APPLICATIONS VIII, VOL 1, 2020, 881 : 116 - 127
  • [10] Parameterized Complexity of the Sparsest k-Subgraph Problem in Chordal Graphs
    Bougeret, Marin
    Bousquet, Nicolas
    Giroudeau, Rodolphe
    Watrigant, Remi
    SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 150 - 161
123