Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 conf/approx/AhmadianBFJSS14
%A Ahmadian, Sara
%A Behsaz, Babak
%A Friggstad, Zachary
%A Jorati, Amin
%A Salavatipour, Mohammad R.
%A Swamy, Chaitanya
%B APPROX-RANDOM
%D 2014
%E Jansen, Klaus
%E Rolim, José D. P.
%E Devanur, Nikhil R.
%E Moore, Cristopher
%I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
%K dblp
%P 17-33
%T Approximation Algorithms for Minimum-Load k-Facility Location.
%U http://dblp.uni-trier.de/db/conf/approx/approx2014.html#AhmadianBFJSS14
%V 28
%@ 978-3-939897-74-3
@inproceedings{conf/approx/AhmadianBFJSS14,
added-at = {2018-08-23T00:00:00.000+0200},
author = {Ahmadian, Sara and Behsaz, Babak and Friggstad, Zachary and Jorati, Amin and Salavatipour, Mohammad R. and Swamy, Chaitanya},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/213e698e95f7c7980277ccc526d2edd39/dblp},
booktitle = {APPROX-RANDOM},
crossref = {conf/approx/2014},
editor = {Jansen, Klaus and Rolim, José D. P. and Devanur, Nikhil R. and Moore, Cristopher},
ee = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.17},
interhash = {e3e081e079eeaf22f4df214c85deaa5d},
intrahash = {13e698e95f7c7980277ccc526d2edd39},
isbn = {978-3-939897-74-3},
keywords = {dblp},
pages = {17-33},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
series = {LIPIcs},
timestamp = {2019-09-27T21:48:56.000+0200},
title = {Approximation Algorithms for Minimum-Load k-Facility Location.},
url = {http://dblp.uni-trier.de/db/conf/approx/approx2014.html#AhmadianBFJSS14},
volume = 28,
year = 2014
}