A Primal-Dual Approximation Algorithm for the Facility Location Problem with Submodular Penalties

We consider the facility location problem with submodular penalties (FLPSP), introduced by Hayrapetyan et al. (Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 933–942, 2005 ), who presented a 2.50-approximation algorithm that is non-combinatorial because thi...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 63; číslo 1-2; s. 191 - 200
Hlavní autoři:	Du, Donglei, Lu, Ruixing, Xu, Dachuan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.06.2012 Springer
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Information Theory Exact sciences and technology Flows in networks. Combinatorial problems Logistics Mathematical programming Mathematics of Computing Operational research and scientific management Operational research. Management science Theoretical computing Theory of Computation Facility location problem Approximation algorithm Submodular function Geographical isolation Combinatorial problem Linear programming Polynomial method Combinatorial optimization Computational complexity Location problem Polynomial time Integer programming Facility location Primal dual method Relaxation method Ellipsoid
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!