On the average case performance of some greedy approximation algorithms for the uncapacited facility location problem

A.D. Flaxman, A.F. Frieze, J.C. Vera

Research output: Contribution to journalArticleProfessional

30 Downloads (Pure)
Original languageEnglish
Pages (from-to)713-732
Number of pages20
JournalCombinatorics, Probability and Computing
Volume16
Issue number5
Publication statusPublished - 2007
Externally publishedYes

Cite this

@article{954c769c0130421da277d200de1d15c0,
title = "On the average case performance of some greedy approximation algorithms for the uncapacited facility location problem",
author = "A.D. Flaxman and A.F. Frieze and J.C. Vera",
note = "Pagination: 20",
year = "2007",
language = "English",
volume = "16",
pages = "713--732",
journal = "Combinatorics, Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "5",

}

On the average case performance of some greedy approximation algorithms for the uncapacited facility location problem. / Flaxman, A.D.; Frieze, A.F.; Vera, J.C.

In: Combinatorics, Probability and Computing, Vol. 16, No. 5, 2007, p. 713-732.

Research output: Contribution to journalArticleProfessional

TY - JOUR

T1 - On the average case performance of some greedy approximation algorithms for the uncapacited facility location problem

AU - Flaxman, A.D.

AU - Frieze, A.F.

AU - Vera, J.C.

N1 - Pagination: 20

PY - 2007

Y1 - 2007

M3 - Article

VL - 16

SP - 713

EP - 732

JO - Combinatorics, Probability and Computing

JF - Combinatorics, Probability and Computing

SN - 0963-5483

IS - 5

ER -