diff options
Diffstat (limited to 'notes.bib')
| -rw-r--r-- | notes.bib | 120 |
1 files changed, 119 insertions, 1 deletions
@@ -167,4 +167,122 @@ year = {1970}, publisher = {American Statistical Association}, copyright = {Copyright © 1970 American Statistical Association}, - } +} + +@article{pipage, + author = {Alexander A. Ageev and + Maxim Sviridenko}, + title = {Pipage Rounding: A New Method of Constructing Algorithms + with Proven Performance Guarantee}, + journal = {J. Comb. Optim.}, + volume = {8}, + number = {3}, + year = {2004}, + pages = {307-328}, + ee = {http://dx.doi.org/10.1023/B:JOCO.0000038913.96607.c2}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{sviridenko-submodular, + author = {Maxim Sviridenko}, + title = {A note on maximizing a submodular set function subject to + a knapsack constraint}, + journal = {Oper. Res. Lett.}, + volume = {32}, + number = {1}, + year = {2004}, + pages = {41-43}, + ee = {http://dx.doi.org/10.1016/S0167-6377(03)00062-2}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@article{krause-submodular, + title={A note on the budgeted maximization of submodular functions}, + author={Krause, A. and Guestrin, C.}, + year={2005} +} + +@article{nemhauser, + title={An analysis of approximations for maximizing submodular set functions—I}, + author={Nemhauser, G.L. and Wolsey, L.A. and Fisher, M.L.}, + journal={Mathematical Programming}, + volume={14}, + number={1}, + pages={265--294}, + year={1978}, + publisher={Springer} +} + +@inproceedings{singer-influence, + author = {Yaron Singer}, + title = {How to win friends and influence people, truthfully: influence + maximization mechanisms for social networks}, + booktitle = {WSDM}, + year = {2012}, + pages = {733-742}, + ee = {http://doi.acm.org/10.1145/2124295.2124381}, + crossref = {DBLP:conf/wsdm/2012}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/wsdm/2012, + editor = {Eytan Adar and + Jaime Teevan and + Eugene Agichtein and + Yoelle Maarek}, + title = {Proceedings of the Fifth International Conference on Web + Search and Web Data Mining, WSDM 2012, Seattle, WA, USA, + February 8-12, 2012}, + booktitle = {WSDM}, + publisher = {ACM}, + year = {2012}, + isbn = {978-1-4503-0747-5}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{singer-mechanisms, + author = {Yaron Singer}, + title = {Budget Feasible Mechanisms}, + booktitle = {FOCS}, + year = {2010}, + pages = {765-774}, + ee = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2010.78}, + crossref = {DBLP:conf/focs/2010}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/focs/2010, + title = {51th Annual IEEE Symposium on Foundations of Computer Science, + FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA}, + booktitle = {FOCS}, + publisher = {IEEE Computer Society}, + year = {2010}, + isbn = {978-0-7695-4244-7}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@inproceedings{chen, + author = {Ning Chen and + Nick Gravin and + Pinyan Lu}, + title = {On the Approximability of Budget Feasible Mechanisms}, + booktitle = {SODA}, + year = {2011}, + pages = {685-699}, + ee = {http://www.siam.org/proceedings/soda/2011/SODA11_054_chenn.pdf}, + crossref = {DBLP:conf/soda/2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + +@proceedings{DBLP:conf/soda/2011, + editor = {Dana Randall}, + title = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium + on Discrete Algorithms, SODA 2011, San Francisco, California, + USA, January 23-25, 2011}, + booktitle = {SODA}, + publisher = {SIAM}, + year = {2011}, + bibsource = {DBLP, http://dblp.uni-trier.de} +} + + |