FAST APPROXIMATION ALGORITHMS FOR A NONCONVEX COVERING PROBLEM

被引：33
|
作者：
HOCHBAUM, DS
MAASS, W
机构：
[1] UNIV CALIF BERKELEY,BERKELEY,CA 94720
[2] UNIV ILLINOIS,CHICAGO,IL 60680
来源：
JOURNAL OF ALGORITHMS | 1987年 / 8卷 / 03期
关键词：
D O I：
10.1016/0196-6774(87)90012-5
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：305 / 323
页数：19
相关论文
共 50 条
  • [41] APPROXIMATION ALGORITHMS FOR THE SET COVERING AND VERTEX COVER PROBLEMS
    HOCHBAUM, DS
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 555 - 556
  • [42] Binary Bat Algorithms for the Set Covering Problem
    Crawford, Broderick
    Soto, Ricardo
    Olea, Claudia
    Johnson, Franklin
    Paredes, Fernando
    2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
  • [43] Algorithms for solving the conditional covering problem on paths
    Lunday, BJ
    Smith, JC
    Goldberg, JB
    NAVAL RESEARCH LOGISTICS, 2005, 52 (04) : 293 - 301
  • [44] Fast initialization methods for the nonconvex economic dispatch problem
    El-Sayed, Wael T.
    El-Saadany, Ehab F.
    Zeineldin, Hatem H.
    Al-Sumaiti, Ameena S.
    ENERGY, 2020, 201 (201)
  • [45] Multiplierless approximation of fast DCT algorithms
    Chan, Raymond K. W.
    Lee, Moon-Chuen
    2006 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO - ICME 2006, VOLS 1-5, PROCEEDINGS, 2006, : 1925 - 1928
  • [46] Successive Convex Approximation Algorithms for Sparse Signal Estimation with Nonconvex Regularizations
    Yang, Yang
    Pesavento, Marius
    Chatzinotas, Symeon
    Ottersten, Bjoern
    2018 IEEE 10TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2018, : 356 - 360
  • [47] Successive Convex Approximation Algorithms for Sparse Signal Estimation With Nonconvex Regularizations
    Yang, Yang
    Pesavento, Marius
    Chatzinotas, Symeon
    Ottersten, Bjorn
    IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2018, 12 (06) : 1286 - 1302
  • [48] An Improved Approximation Algorithm for the Most Points Covering Problem
    Ghasemalizadeh, Hossein
    Razzazi, Mohammadreza
    THEORY OF COMPUTING SYSTEMS, 2012, 50 (03) : 545 - 558
  • [49] An approximation algorithm for the general mixed packing and covering problem
    Diedrich, Florian
    Jansen, Klaus
    COMBINATORICS, ALGORITHMS, PROBABILISTIC AND EXPERIMENTAL METHODOLOGIES, 2007, 4614 : 128 - +
  • [50] An Improved Approximation Algorithm for the Most Points Covering Problem
    Hossein Ghasemalizadeh
    Mohammadreza Razzazi
    Theory of Computing Systems, 2012, 50 : 545 - 558
12345