Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Approximation algorithms for bounded facility location problems
Autore:
Krysta, P; Solis-Oba, R;
Indirizzi:
Max Planck Inst Informat, Saarbrucken, Germany Max Planck Inst Informat Saarbrucken Germany rmat, Saarbrucken, Germany
Titolo Testata:
JOURNAL OF COMBINATORIAL OPTIMIZATION
fascicolo: 2, volume: 5, anno: 2001,
pagine: 233 - 247
SICI:
1382-6905(200106)5:2<233:AAFBFL>2.0.ZU;2-9
Fonte:
ISI
Lingua:
ENG
Keywords:
facility location; approximation algorithms; randomized algorithms; clustering;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Physical, Chemical & Earth Sciences
Engineering, Computing & Technology
Citazioni:
21
Recensione:
Indirizzi per estratti:
Indirizzo: Krysta, P Max Planck Inst Informat, Saarbrucken, Germany Max Planck Inst Informat Saarbrucken Germany brucken, Germany
Citazione:
P. Krysta e R. Solis-Oba, "Approximation algorithms for bounded facility location problems", J COMB OPTI, 5(2), 2001, pp. 233-247

Abstract

The bounded k-median problem is to select in an undirected graph G = (V,E)a set S of k vertices such that the distance from any vertex v is an element of V to S is at most a given bound d and the average distance from vertices V\S to S is minimized. We present randomized algorithms for several versions of this problem and we prove some inapproximability results. We also study the bounded version of the uncapacitated facility location problem and present extensions of known deterministic algorithms for the unbounded version.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 09/04/20 alle ore 13:24:20