Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
暂无分享,去创建一个
[1] Neal E. Young,et al. On-line caching as cache size varies , 1991, SODA '91.
[2] Dror Rawitz,et al. Efficient Algorithms for Integer Programs with Two Variables per Constraint1 , 2001, Algorithmica.
[3] Neal E. Young,et al. Thek-server dual and loose competitiveness for paging , 1994, Algorithmica.
[4] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[5] Ewald Speckenmeyer,et al. Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.
[6] Neal E. Young,et al. On-Line File Caching , 2002, SODA '98.
[7] Amitabh Sinha,et al. Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems , 2006, Math. Program..
[8] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[9] L. Wolsey,et al. On the greedy heuristic for continuous covering and packing problems , 1982 .
[10] Yuval Peres,et al. Mixing Time Power Laws at Criticality , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[11] Reuven Bar-Yehuda,et al. A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem , 1981, J. Algorithms.
[12] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing Problems , 2005, ESA.
[13] Fabián A. Chudak,et al. Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovász extension and non-smooth convex optimization , 2007, SODA '07.
[14] Aravind Srinivasan,et al. Improved Approximation Guarantees for Packing and Covering Integer Programs , 1999, SIAM J. Comput..
[15] Eran Halperin,et al. Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs , 2000, SODA '00.
[16] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[17] Christos Koufogiannakis,et al. Distributed and parallel algorithms for weighted vertex cover and other covering problems , 2009, PODC '09.
[18] Prabhakar Raghavan,et al. Memory versus randomization in on-line algorithms , 1994, IBM J. Res. Dev..
[19] Edith Cohen,et al. Connection caching: model and algorithms , 2003, J. Comput. Syst. Sci..
[20] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[21] Gregory Dobson,et al. Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..
[22] Dror Rawitz,et al. On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique , 2005, SIAM J. Discret. Math..
[23] Susanne Albers. On Generalized Connection Caching , 2002, Theory of Computing Systems.
[24] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..
[25] Aravind Srinivasan,et al. New approaches to covering and packing problems , 2001, SODA '01.
[26] Dorit S. Hochbaum,et al. A fast approximation algorithm for the multicovering problem , 1986, Discret. Appl. Math..
[27] Satoru Iwata,et al. Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[28] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[29] Deeparnab Chakrabarty,et al. Approximability of Sparse Integer Programs , 2009, Algorithmica.
[30] Stefano Leonardi,et al. Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings , 2005, ESA.
[31] Allan Borodin,et al. How well can primal-dual and local-ratio algorithms perform? , 2005, TALG.
[32] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.
[33] Robert D. Carr,et al. Strengthening integrality gaps for capacitated network design and covering problems , 2000, SODA '00.
[34] Boaz Patt-Shamir,et al. Rent, Lease, or Buy: Randomized Algorithms for Multislope Ski Rental , 2008, SIAM J. Discret. Math..
[35] Joseph Naor,et al. Randomized competitive algorithms for generalized caching , 2008, STOC.
[36] Dror Rawitz,et al. Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004 , 2004, CSUR.
[37] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[38] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[39] Sandy Irani,et al. Cost-Aware WWW Proxy Caching Algorithms , 1997, USENIX Symposium on Internet Technologies and Systems.
[40] Dimitris Bertsimas,et al. Rounding algorithms for covering problems , 1998, Math. Program..
[41] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[42] Amos Fiat,et al. Competitive Paging Algorithms , 1991, J. Algorithms.
[43] Dorit S. Hochbaum,et al. Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..
[44] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[45] Edith Cohen,et al. Connection caching , 1999, STOC '99.
[46] Christos Koufogiannakis,et al. Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality , 2009, DISC.
[47] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[48] Martin Arlitt,et al. Enhancement and Validation of Squid's Cache Replacement Policy , 1999 .
[49] David S. Johnson. Approximation algorithms for combinatorial problems , 1973, STOC '73.
[50] Jaikumar Radhakrishnan,et al. Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.
[51] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[52] Chaitanya Swamy,et al. Stochastic optimization is (almost) as easy as deterministic optimization , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[53] James B. Orlin,et al. A faster strongly polynomial time algorithm for submodular function minimization , 2007, Math. Program..
[54] Edith Cohen,et al. Connection caching under various models of communication , 2000, SPAA '00.
[55] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.
[56] Chaitanya Swamy,et al. Network design for information networks , 2005, SODA '05.
[57] Lyle A. McGeoch,et al. A strongly competitive randomized paging algorithm , 1991, Algorithmica.
[58] Anna R. Karlin,et al. Competitive snoopy caching , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[59] Reuven Bar-Yehuda,et al. One for the Price of Two: a Unified Approach for Approximating Covering Problems , 1998, Algorithmica.
[60] Joseph Naor,et al. A Primal-Dual Randomized Algorithm for Weighted Paging , 2007, FOCS.
[61] Dorit S. Hochbaum,et al. Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..
[62] Stavros G. Kolliopoulos,et al. Approximation Algorithms for Covering/Packing Integer Programs , 2002, cs/0205030.