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
关键词
D O I
10.1016/0196-6774(87)90012-5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:305 / 323
页数:19
相关论文
共 50 条
  • [21] Approximation of the quadratic set covering problem
    Escoffier, Bruno
    Hammer, Peter L.
    DISCRETE OPTIMIZATION, 2007, 4 (3-4) : 378 - 386
  • [22] Approximation of a geometric set covering problem
    Kovaleva, S
    Spieksma, FCR
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 493 - 501
  • [23] An approximation algorithm for the covering Steiner problem
    Konjevod, G
    Ravi, R
    PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 338 - 344
  • [24] Approximation Algorithms for Union and Intersection Covering Problems
    Cygan, Marek
    Grandoni, Fabrizio
    Leonardi, Stefano
    Mucha, Marcin
    Pilipczuk, Marcin
    Sankowski, Piotr
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 28 - 40
  • [25] Approximation Algorithms for Covering Vertices by Long Paths
    Gong, Mingyang
    Edgar, Brett
    Fan, Jing
    Lin, Guohui
    Miyano, Eiji
    ALGORITHMICA, 2024, 86 (08) : 2625 - 2651
  • [26] Approximation algorithms for covering/packing integer programs
    Kolliopoulos, SG
    Young, NE
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 71 (04) : 495 - 505
  • [27] PARAMETERIZATION AND APPROXIMATION OF A NONCONVEX PROBLEM - APPLICATION TO A PORTFOLIO SELECTION PROBLEM
    LEFEBVRE, O
    RAIRO-ANALYSE NUMERIQUE-NUMERICAL ANALYSIS, 1983, 17 (03): : 293 - 309
  • [28] Efficient algorithms for the conditional covering problem
    Benkoczi, Robert
    Bhattacharya, Binay
    Hu, Yuzhuang
    Lin, Chien-Hsin
    Shi, Qiaosheng
    Wang, Biing-Feng
    INFORMATION AND COMPUTATION, 2012, 219 : 39 - 57
  • [29] ON THE COMPLEXITY OF NONCONVEX COVERING
    MAASS, W
    SIAM JOURNAL ON COMPUTING, 1986, 15 (02) : 453 - 467
  • [30] Block Successive Convex Approximation Algorithms for Nonsmooth Nonconvex Optimization
    Yang, Yang
    Pesavento, Marius
    Luo, Zhi-Quan
    Ottersten, Bjorn
    CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 660 - 664