Search dblp for Publications

export results for "Approximating Min-sum Set Cover"

 download as .bib file

@article{DBLP:journals/algorithmica/FeigeLT04,
  author       = {Uriel Feige and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Prasad Tetali},
  title        = {Approximating Min Sum Set Cover},
  journal      = {Algorithmica},
  volume       = {40},
  number       = {4},
  pages        = {219--234},
  year         = {2004},
  url          = {https://doi.org/10.1007/s00453-004-1110-5},
  doi          = {10.1007/S00453-004-1110-5},
  timestamp    = {Tue, 01 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FeigeLT04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/FeigeLT02,
  author       = {Uriel Feige and
                  L{\'{a}}szl{\'{o}} Lov{\'{a}}sz and
                  Prasad Tetali},
  editor       = {Klaus Jansen and
                  Stefano Leonardi and
                  Vijay V. Vazirani},
  title        = {Approximating Min-sum Set Cover},
  booktitle    = {Approximation Algorithms for Combinatorial Optimization, 5th International
                  Workshop, {APPROX} 2002, Rome, Italy, September 17-21, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2462},
  pages        = {94--107},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45753-4\_10},
  doi          = {10.1007/3-540-45753-4\_10},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/FeigeLT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics