Primal–dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach

The main contribution of this work is to propose a primal–dual combinatorial 3(1+ε)-approximation algorithm for the two-level facility location problem (2-LFLP) by exploring the approximation oracle concept. This result improves the previous primal–dual 6-approximation algorithm for the multilevel f...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 562; S. 213 - 226
Hauptverfasser:	Wu, Chenchen, Du, Donglei, Xu, Dachuan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 2015
Schlagworte:	Algorithms Approximation Approximation algorithm Combinatorial analysis Computer simulation Facility location problem Mathematical analysis Multilevel Operations research Primal–dual algorithm Site selection Facility location problem Approximation algorithm Primal–dual algorithm
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!