Approximation algorithm for the fault-tolerant knapsack center problem

DOI10.1007/S11590-026-02303-YMaRDI QIDQ7410121zbMATH OpenFDO

Authors Runjie Miao

Publication date 2026

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-026-02303-Y

zbMATH Keywords

\(k\)-center problemapproximation algorithmfacility location problemfault tolerantknapsack center problem

Mathematics Subject Classification ID

General and overarching topics; collections (00-XX)

Cites work

• A Best Possible Heuristic for the k-Center Problem
• Clustering to minimize the maximum intercluster distance
• Combinatorial optimization. Theory and algorithms
• Easy and hard bottleneck location problems
• Fair colorful \(k\)-center clustering
• Fault tolerant \(K\)-center problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Matroid and knapsack center problems
• On the integrality gap of MFN relaxation for the capacitated facility location problem
• The Capacitated K-Center Problem
• The design of approximation algorithms
• The facility location problem with maximum distance constraint

This page was built for publication: Approximation algorithm for the fault-tolerant knapsack center problem

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