Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
暂无分享,去创建一个
[1] Gunnar Andersson,et al. An Approximation Algorithm for Max p-Section , 1999, STACS.
[2] Marek Karpinski,et al. Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems , 1999, J. Comput. Syst. Sci..
[3] Mark S. Squillante,et al. Optimal scheduling of multiclass parallel machines , 1999, SODA '99.
[4] Maxim Sviridenko,et al. An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts , 2000, ESA.
[5] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[6] D. Hochbaum. Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .
[7] L. Wolsey. Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems , 1982, Math. Oper. Res..
[8] David P. Williamson,et al. New 3⁄4 - Approximation Algorithms for MAX SAT , 2001 .
[9] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[10] Maxim Sviridenko,et al. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.
[11] G. Nemhauser,et al. Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms , 1977 .
[12] Alan M. Frieze,et al. Improved approximation algorithms for MAXk-CUT and MAX BISECTION , 1995, Algorithmica.
[13] Martin Skutella,et al. Semidefinite relaxations for parallel machine scheduling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[14] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[15] Lars Engebretsen,et al. Better Approximation Algorithms for SET SPLITTING and NOT-ALL-EQUAL SAT , 1998, Inf. Process. Lett..
[16] Dorit S. Hochbaum,et al. Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..
[17] Laurence A. Wolsey,et al. Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem , 1980, Oper. Res..
[18] Jadranka Skorin-Kapov,et al. Using quadratic programming to solve high multiplicity scheduling problems on parallel machines , 2006, Algorithmica.
[19] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[20] Martin Skutella,et al. Convex quadratic and semidefinite programming relaxations in scheduling , 2001, JACM.
[21] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[22] David P. Williamson,et al. New 3/4-Approximation Algorithms for the Maximum Satisfiability Problem , 1994, SIAM J. Discret. Math..