Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity

Elliot Anshelevich, Deeparnab Chakrabarty, Ameya Hate, Chaitanya Swamy. Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity. In Yingfei Dong, Ding-Zhu Du, Oscar H. Ibarra, editors, Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings. Volume 5878 of Lecture Notes in Computer Science, pages 974-983, Springer, 2009. [doi]

@inproceedings{AnshelevichCHS09,
  title = {Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity},
  author = {Elliot Anshelevich and Deeparnab Chakrabarty and Ameya Hate and Chaitanya Swamy},
  year = {2009},
  doi = {10.1007/978-3-642-10631-6_98},
  url = {http://dx.doi.org/10.1007/978-3-642-10631-6_98},
  researchr = {https://researchr.org/publication/AnshelevichCHS09},
  cites = {0},
  citedby = {0},
  pages = {974-983},
  booktitle = {Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
  editor = {Yingfei Dong and Ding-Zhu Du and Oscar H. Ibarra},
  volume = {5878},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-10630-9},
}