|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
2008 49th Annual IEEE Symposium on Foundations of Computer Science
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
October 25-October 28
ISBN: 978-0-7695-3436-7
| ASCII Text | x | ||
| Zoya Svitkina, Lisa Fleischer, "Submodular Approximation: Sampling-based Algorithms and Lower Bounds," Foundations of Computer Science, IEEE Annual Symposium on, pp. 697-706, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008. | |||
| BibTex | x | ||
| @article{ 10.1109/FOCS.2008.66, author = {Zoya Svitkina and Lisa Fleischer}, title = {Submodular Approximation: Sampling-based Algorithms and Lower Bounds}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {2008}, issn = {0272-5428}, pages = {697-706}, doi = {http://doi.ieeecomputersociety.org/10.1109/FOCS.2008.66}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Submodular Approximation: Sampling-based Algorithms and Lower Bounds SN - 0272-5428 SP697 EP706 A1 - Zoya Svitkina, A1 - Lisa Fleischer, PY - 2008 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2008.66
We introduce several generalizations of classical computer science problems obtained by
Citation:
Zoya Svitkina, Lisa Fleischer, "Submodular Approximation: Sampling-based Algorithms and Lower Bounds," focs, pp.697-706, 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.