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 条
  • [31] Fast algorithms for minimum covering run expression
    Chinveeraphan, Supoj
    Zidouri, AbdelMalek B.C.
    Sato, Makoto
    1600, Publ by Inst of Electronics, Inf & Commun Engineers of Japan, Tokyo, Japan (E77-D):
  • [32] FAST ALGORITHMS FOR MINIMUM COVERING RUN EXPRESSION
    CHINVEERAPHAN, S
    ZIDOURI, ABC
    SATO, M
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1994, E77D (03) : 317 - 325
  • [33] An Improved Approximation Ratio for the Covering Steiner Problem
    Computer Science Department, Carnegie Mellon University, Pittsburgh
    PA
    15232, United States
    不详
    MD
    20742, United States
    Theory Comput., 2006, (53-64):
  • [34] Approximation algorithms for geometric conflict free covering problems
    Banik, Aritra
    Sahlot, Vibha
    Saurabh, Saket
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2020, 89
  • [35] Improved approximation algorithms for minimum power covering problems
    Calinescu, Gruia
    Kortsarz, Guy
    Nutov, Zeev
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 285 - 300
  • [36] Improved Approximation Algorithms for Minimum Power Covering Problems
    Calinescu, Gruia
    Kortsarz, Guy
    Nutov, Zeev
    APPROXIMATION AND ONLINE ALGORITHMS (WAOA 2018), 2018, 11312 : 134 - 148
  • [37] Exact and approximation algorithms for covering timeline in temporal graphs
    Dondi, Riccardo
    Popa, Alexandru
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [38] Covering a tree with rooted subtrees - parameterized and approximation algorithms
    Chen, Lin
    Marx, Daniel
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2801 - 2820
  • [39] Approximation algorithms for mixed fractional packing and covering problems
    Jansen, K
    EXPLORING NEW FRONTIERS OF THEORETICAL INFORMATICS, 2004, 155 : 223 - 236
  • [40] Approximation algorithms for mixed fractional packing and covering problems
    Jansen, K
    APPROXIMATION AND ONLINE ALGORITHMS, 2004, 3351 : 6 - 8
12345