Approximation Algorithms for Matroid and Knapsack Means Problems

DOI10.1142/s0217595922400073OpenAlexW4210729708WikidataQ113343366 ScholiaQ113343366MaRDI QIDQ6053494

Unnamed Author, Qian Liu, Unnamed Author, Min Li

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595922400073

zbMATH Keywords

approximation algorithmmatroidknapsackknapsack means problemmatroid means problem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid and knapsack center problems
• A local search approximation algorithm for \(k\)-means clustering
• Local search algorithms for the red-blue median problem
• Approximation algorithms for the robust facility leasing problem
• The bi-criteria seeding algorithms for two variants of \(k\)-means problem
• The seeding algorithm for spherical \(k\)-means clustering with penalties
• Approximation algorithms for two variants of correlation clustering problem
• The seeding algorithm for \(k\)-means problem with penalties
• A Dependent LP-Rounding Approach for the k-Median Problem
• Adaptive Sampling for k-Means Clustering
• Least squares quantization in PCM
• Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications
• Small Space Stream Summary for Matroid Center

This page was built for publication: Approximation Algorithms for Matroid and Knapsack Means Problems