Approximation algorithm for the fault-tolerant facility placement problem with penalties

DOI10.15960/J.CNKI.ISSN.1007-6093.2016.02.006MaRDI QIDQ2951646zbMATH OpenFDO

Authors Rui Fang, Wenchang Luo

Publication date 6 January 2017

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2016.02.006

zbMATH Keywords

approximation algorithmfault-tolerant facilitypenaltiesplacement problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for the fault-tolerant facility placement problem
• LP-rounding algorithms for the fault-tolerant facility placement problem (extended abstract)
• Approximation algorithms for the fault-tolerant facility location problem with penalties
• Improved approximation algorithm for fault-tolerant facility placement
• LP-rounding algorithms for the fault-tolerant facility placement problem

Cited in

(4)

• Approximation algorithms for the fault-tolerant facility placement problem
• scientific article; zbMATH DE number 1670540 (Why is no real title available?)
• Combinatorial approximation algorithms for the robust facility location problem with penalties
• Approximation Algorithms for the Robust Facility Location Problem with Penalties

This page was built for publication: Approximation algorithm for the fault-tolerant facility placement problem with penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2951646)