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 条
  • [1] Approximation algorithms for the covering Steiner problem
    Konjevod, G
    Ravi, R
    Srinivasan, A
    RANDOM STRUCTURES & ALGORITHMS, 2002, 20 (03) : 465 - 482
  • [2] APPROXIMATION ALGORITHMS FOR THE GEOMETRIC COVERING SALESMAN PROBLEM
    ARKIN, EM
    HASSIN, R
    DISCRETE APPLIED MATHEMATICS, 1994, 55 (03) : 197 - 218
  • [3] Approximation Algorithms for Edge-Covering Problem
    Moghaddam, Mohammad Hosseinzadeh
    Bagheri, Alireza
    ADVANCES IN COMPUTER SCIENCE AND ENGINEERING, 2008, 6 : 930 - +
  • [4] FAST APPROXIMATION ALGORITHMS FOR FRACTIONAL PACKING AND COVERING PROBLEMS
    PLOTKIN, SA
    SHMOYS, DB
    TARDOS, E
    MATHEMATICS OF OPERATIONS RESEARCH, 1995, 20 (02) : 257 - 301
  • [5] 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
  • [6] Approximation algorithms for the k-clique covering problem
    Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063
    SIAM J Discrete Math, 3 (492-509):
  • [7] Computational experience with approximation algorithms for the set covering problem
    Grossman, T
    Wool, A
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 101 (01) : 81 - 92
  • [8] Approximation algorithms design for disk partial covering problem
    Xiao, B
    Cao, JN
    Zhuge, QF
    He, Y
    Sha, EHM
    I-SPAN 2004: 7TH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2004, : 104 - 109
  • [9] A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
    Qiu, Jiaming
    Sharkey, Thomas C.
    OPTIMIZATION LETTERS, 2014, 8 (04) : 1201 - 1212
  • [10] A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
    Jiaming Qiu
    Thomas C. Sharkey
    Optimization Letters, 2014, 8 : 1201 - 1212
12345