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 条
  • [21] Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
    Chen, Li-Hsuan
    Cheng, Dun-Wei
    Hsieh, Sun-Yuan
    Hung, Ling-Ju
    Lee, Chia-Wei
    Wu, Bang Ye
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 222 - 234
  • [22] A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
    Takazawa, Kenjiro
    INFORMATION PROCESSING LETTERS, 2016, 116 (09) : 550 - 553
  • [23] New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
    Chiarelli, Nina
    Romina Hartinger, Tatiana
    Alejandra Leoni, Valeria
    Lopez Pujato, Maria Ines
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 128 - 141
  • [24] A polynomial solution to the k-fixed-endpoint path cover problem on proper interval graphs
    Asdre, Katerina
    Nikolopoulos, Stavros D.
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 967 - 975
  • [25] The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
    Liu, Xianliang
    Wang, Wei
    Kim, Donghyun
    Yang, Zishen
    Tokuta, Alade O.
    Jiang, Yaolin
    WIRELESS NETWORKS, 2016, 22 (02) : 553 - 562
  • [26] The first constant factor approximation for minimum partial connected dominating set problem in growth-bounded graphs
    Xianliang Liu
    Wei Wang
    Donghyun Kim
    Zishen Yang
    Alade O. Tokuta
    Yaolin Jiang
    Wireless Networks, 2016, 22 : 553 - 562
  • [27] PTAS for Densest k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-Subgraph in Interval Graphs
    Tim Nonner
    Algorithmica, 2016, 74 (1) : 528 - 539
123