EFFICIENT BOUNDS FOR THE STABLE SET, VERTEX COVER AND SET PACKING PROBLEMS

被引：169
|
作者：
HOCHBAUM, DS
机构：
来源：
DISCRETE APPLIED MATHEMATICS | 1983年 / 6卷 / 03期
关键词：
D O I：
10.1016/0166-218X(83)90080-X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：243 / 254
页数：12
相关论文
共 50 条
  • [21] Improved algorithms for the feedback vertex set problems
    Chen, Jianer
    Fomin, Fedor V.
    Liu, Yang
    Lu, Songjian
    Villanger, Yngve
    ALGORITHMS AND DATA STRUCTURES, PROCEEDINGS, 2007, 4619 : 422 - +
  • [22] On the price of independence for vertex cover, feedback vertex set and odd cycle transversal☆
    Dabrowski, Konrad K.
    Johnson, Matthew
    Paesani, Giacomo
    Paulusma, Daniel
    Zamaraev, Viktor
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 117
  • [23] Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems
    Xiao, Mingyu
    Kou, Shaowei
    THEORETICAL COMPUTER SCIENCE, 2017, 657 : 86 - 97
  • [24] Approximation of MAX INDEPENDENT SET, MIN VERTEX COVER and related problems by moderately exponential algorithms
    Bourgeois, Nicolas
    Escoffier, Bruno
    Paschos, Vangelis Th.
    DISCRETE APPLIED MATHEMATICS, 2011, 159 (17) : 1954 - 1970
  • [25] New Approximation Bounds for Small-Set Vertex Expansion
    Ghoshal, Suprovat
    Louis, Anand
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 2363 - 2375
  • [26] Towards Tight Bounds for the Streaming Set Cover Problem
    Har-Peled, Sariel
    Indyk, Piotr
    Mahabadi, Sepideh
    Vakilian, Ali
    PODS'16: PROCEEDINGS OF THE 35TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2016, : 371 - 383
  • [27] Dynamic Set Cover: Improved Algorithms and Lower Bounds
    Abboud, Amir
    Addanki, Raghavendra
    Grandoni, Fabrizio
    Panigrahi, Debmalya
    Saha, Barna
    PROCEEDINGS OF THE 51ST ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '19), 2019, : 114 - 125
  • [28] Decomposing Combinatorial Auctions and Set Packing Problems
    Gottlob, Georg
    Greco, Gianluigi
    JOURNAL OF THE ACM, 2013, 60 (04)
  • [29] Facet obtaining procedures for set packing problems
    Cánovas, L
    Landete, M
    Marín, A
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (01) : 127 - 155
  • [30] Fast Distributed Approximation Algorithms for Vertex Cover and Set Cover in Anonymous Networks
    Astrand, Matti
    Suomela, Jukka
    SPAA '10: PROCEEDINGS OF THE TWENTY-SECOND ANNUAL SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2010, : 294 - 302
12345