Computing and Combinatorics

DOI10.1007/11533719MaRDI QIDQ5716985zbMATH OpenOpenAlexFDO

Authors Guang Xu, Jinhui Xu

Publication date 11 January 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11533719

zbMATH Keywords

OutliersFacility LocationApproximation Algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Discrete location and assignment (90B80)

Recommendations

• An improved approximation algorithm for uncapacitated facility location problem with penalties
• An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
• Improved approximation algorithm for universal facility location problem with linear penalties
• Improved approximation algorithm for k-level uncapacitated facility location problem (with penalties)

Cited in

(12)

• scientific article; zbMATH DE number 6263680 (Why is no real title available?)
• scientific article; zbMATH DE number 5811147 (Why is no real title available?)
• A $$(5.83+\epsilon )$$ ( 5.83 + ϵ ) -Approximation Algorithm for Universal Facility Location Problem with Linear Penalties
• An improved approximation algorithm for uncapacitated facility location problem with penalties
• An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
• scientific article; zbMATH DE number 1187151 (Why is no real title available?)
• Improved approximation algorithm for \(k\)-level UFL with penalties, a simplistic view on randomizing the scaling parameter
• An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
• An LP-rounding based algorithm for a uniform capacitated facility location problem with penalties
• An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties
• A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
• An improved branch \& bound method for the uncapacitated competitive location problem

This page was built for publication: Computing and Combinatorics

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