Rong-chii Duh
- 1.P. Berman and M. Ftirer, Approximating maximum independent set in bounded degree graphs, Proc. of the Fifth ACM-SIAM Symp. on Discrete Algorithms, SODA, 1994, pp. 365-371. Google Scholar
Digital Library
- 2.V. Chv~ital, A greed5' heuristic for the set-covering problem, Mathematics Of Operations Research (1979), no. 3,233-235.Google Scholar
- 3.P. Crescenzi and V. Kann, A compendium of NP optimization problems, 1995.Google Scholar
- 4.M. Demange, P. Grisoni, and V. P. Paschos, Approximation results for the minimum graph coloring problem, Information Processing Letters 50 (1994), 19-23. Google ScholarDigital Library
- 5.U. Feige, A threshold of Inn for approximating set cover, Proc. of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC, 1996, pp. 312-318. Google ScholarDigital Library
- 6.O. Goldschmidt, D. S. Hochbaum, and G. Yu, A modified greed), heuristic for the set covering problem with improved worst case bound, Information Processing Letters 48 (1993), 305-310. Google ScholarDigital Library
- 7.M.M. Halld6rsson, Approximating discrete collections via local improvements, Proc. of the Sixth ACM-SIAM Symp. on Discrete Algorithms, SODA, 1995, pp. 160- 169. Google ScholarDigital Library
- 8.--, Approximating k-set cover and complementary graph coloring, Proc. of the 5th IPCO Conf. on Integer Programming and Comb. Opt., June 1996. Google ScholarDigital Library
- 9.R. Hassin and S. Lahav, Maximizing the number of unused colors in the vertex coloring problem, Information Processing Letters 52 (1994), 87-90. Google ScholarDigital Library
- 10.C. A. J. Hurkens and A. Schrijver, On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Disc. Math. 2 (1989), 68-72. Google ScholarDigital Library
- 11.D. S. Johnson, Approximation algorithms for combinatorial problems, Journal Comput. Syst. Sci. 9 (1974), 256-278.Google ScholarDigital Library
- 12.R. M. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), Plenum Press, New York, 1972, pp. 85-103.Google Scholar
- 13.Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, and Umesh Vazirani, On syntactic versus computational views of approximability, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 819-830.Google ScholarDigital Library
- 14.L. Lov~isz, On the ratio of optimal integral and fractional covers, Discrete Mathematics (1975), 383-390.Google Scholar
- 15.C. Papademitriou and M. Yannakakis, Optimization, approximation and complexit), classes, Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, 1988, pp. 229-234. Google ScholarDigital Library
Index Terms
- Approximation of k-set cover by semi-local optimization
Recommendations
Inexact Successive quadratic approximation for regularized optimization
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration complexity focus on ...
Second-order Karush---Kuhn---Tucker optimality conditions for set-valued optimization
In this paper, we propose the concept of a second-order composed contingent derivative for set-valued maps, discuss its relationship to the second-order contingent derivative and investigate some of its special properties. By virtue of the second-order ...
Semi-continuous quadratic optimization: existence conditions and duality scheme
In this work, we study the class of problems called semi-continuous optimization, which contains constrained minimization (maximization) problems with lower (upper) semi-continuous objective functions. We show some existence conditions for solutions ...
Comments