How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems

Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh. How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings. pages 367-378, IEEE Computer Society, 2005. [doi]

@inproceedings{DhamdhereGRS05,
  title = {How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems},
  author = {Kedar Dhamdhere and Vineet Goyal and R. Ravi and Mohit Singh},
  year = {2005},
  doi = {10.1109/SFCS.2005.42},
  url = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.42},
  researchr = {https://researchr.org/publication/DhamdhereGRS05},
  cites = {0},
  citedby = {0},
  pages = {367-378},
  booktitle = {46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings},
  publisher = {IEEE Computer Society},
  isbn = {0-7695-2468-0},
}