Approximation algorithms for the k-clique covering problem

被引：0
|
作者：
Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063 [1 ]
机构：
来源：
SIAM J Discrete Math | / 3卷 / 492-509期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Approximation algorithms for the k-clique covering problem
    Goldschmidt, O
    Hochbaum, DS
    Hurkens, C
    Yu, G
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1996, 9 (03) : 492 - 509
  • [2] Approximation Algorithms on k-Cycle Transversal and k-Clique Transversal
    Zhong-Zheng Tang
    Zhuo Diao
    Journal of the Operations Research Society of China, 2021, 9 : 883 - 892
  • [3] Approximation Algorithms on k-Cycle Transversal and k-Clique Transversal
    Tang, Zhong-Zheng
    Diao, Zhuo
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (04) : 883 - 892
  • [4] Faster Combinatorial k-Clique Algorithms
    Abboud, Amir
    Fischer, Nick
    Shechter, Yarin
    LATIN 2024: THEORETICAL INFORMATICS, PT I, 2024, 14578 : 193 - 206
  • [5] The K-clique Densest Subgraph Problem
    Tsourakakis, Charalampos E.
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, : 1122 - 1132
  • [6] The Binomial k-Clique
    Narayana, Nithya Sai
    Sane, Sharad
    JOURNAL OF COMBINATORIAL DESIGNS, 2013, 21 (01) : 36 - 45
  • [7] Parallel K-clique Counting on GPUs
    Almasri, Mohammad
    El Hajj, Izzat
    Nagi, Rakesh
    Xiong, Jinjun
    Hwu, Wen-Mei
    PROCEEDINGS OF THE 36TH ACM INTERNATIONAL CONFERENCE ON SUPERCOMPUTING, ICS 2022, 2022,
  • [8] The dynamic descriptive complexity of k-clique
    Zeume, Thomas
    INFORMATION AND COMPUTATION, 2017, 256 : 9 - 22
  • [9] Approximation algorithms for the covering Steiner problem
    Konjevod, G
    Ravi, R
    Srinivasan, A
    RANDOM STRUCTURES & ALGORITHMS, 2002, 20 (03) : 465 - 482
  • [10] The Dynamic Descriptive Complexity of k-Clique
    Zeume, Thomas
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2014, PT I, 2014, 8634 : 547 - 558
12345