共 50 条
- [22] Approximation of a geometric set covering problem ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 493 - 501
- [23] An approximation algorithm for the covering Steiner problem PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2000, : 338 - 344
- [24] Approximation Algorithms for Union and Intersection Covering Problems IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 28 - 40
- [27] PARAMETERIZATION AND APPROXIMATION OF A NONCONVEX PROBLEM - APPLICATION TO A PORTFOLIO SELECTION PROBLEM RAIRO-ANALYSE NUMERIQUE-NUMERICAL ANALYSIS, 1983, 17 (03): : 293 - 309
- [30] Block Successive Convex Approximation Algorithms for Nonsmooth Nonconvex Optimization CONFERENCE RECORD OF THE 2019 FIFTY-THIRD ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS & COMPUTERS, 2019, : 660 - 664