Tight Approximation Bounds for Greedy Frugal Coverage Algorithms - ORA - Oxford University Research Archive

Back to Search

Book

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Actions

Email

Email this record

Send the bibliographic details of this record to your email address.

Your Email
Please enter the email address that the record information will be sent to.

-
Your message (optional)
Please add any additional information to be included within the email.
Cite

Cite this record

APA Style

Caragiannis, I., Kaklamanis, C., & Kyropoulou, M. (2011). Tight Approximation Bounds for Greedy Frugal Coverage Algorithms (pp. 185–195).

MLA Style

Caragiannis, I., et al. Tight Approximation Bounds for Greedy Frugal Coverage Algorithms. 2011, pp. 185–95.

Chicago Style

Caragiannis, I, C Kaklamanis, and M Kyropoulou. 2011. Tight Approximation Bounds for Greedy Frugal Coverage Algorithms.
Tweet
Print

Access Document

Publisher copy:: 10.1007/978-3-642-21204-8_22

Authors

+ Caragiannis, I More by this author

Role:

Author

+ Kaklamanis, C More by this author

Role:

Author

+ Kyropoulou, M More by this author

Role:

Author

Bibliographic Details

Host title:: Proceedings of the First Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW−AAIM)
Pages:: 185-195
Publication date:: 2011-01-01
DOI:: 10.1007/978-3-642-21204-8_22
ISBN:: 9783642212031

Item Description

UUID:: uuid:acd3b25b-94b3-4e14-a827-ab7d7a7be4da
Local pid:: cs:8737
Deposit date:: 2015-03-31

Terms of use

Copyright date:: 2011

Licence:: Terms and Conditions of Use for Oxford University Research Archive

Metrics

Views and Downloads

About views and downloads

If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP