An approximation algorithm for the parity-constrained k-supplier problem

DOI10.1016/J.TCS.2025.115413MaRDI QIDQ6949550zbMATH OpenFDO

Authors Xinlan Xia, Lu Han, Lili Mei

Publication date 1 August 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115413

zbMATH Keywords

\(k\)-supplierapproximation algorithmsparity constraints

Mathematics Subject Classification ID

Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Combinatorial optimization (90C27)

Cites work

• A 1.488 approximation algorithm for the uncapacitated facility location problem
• A Best Possible Heuristic for the k-Center Problem
• A heuristic for the p-center problem in graphs
• A semi brute-force search approach for (balanced) clustering
• An approximation algorithm for diversity-aware fair \(k\)-supplier problem
• Approximating k-median via pseudo-approximation
• Approximation algorithms for the individually fair k-center with outliers
• Clustering to minimize the maximum intercluster distance
• Constant-factor approximation algorithms for parity-constrained facility location and \(k\)-center
• Corrigendum to our paper The ellipsoid method and its consequences in combinatorial optimization
• Graph orientations with edge-connection and parity constraints
• scientific article; zbMATH DE number 3902670 (Why is no real title available?)
• On some variants of Euclidean \(k\)-supplier
• The Capacitated K-Center Problem
• The ellipsoid method and its consequences in combinatorial optimization
• The Euclidean k-supplier problem
• The Non-Uniform k -Center Problem

This page was built for publication: An approximation algorithm for the parity-constrained \(k\)-supplier problem

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