Approximation Algorithms
Overview
Approximation algorithms study how to solve optimization problems efficiently when finding an exact optimum is computationally infeasible, while measuring how close the result is to the best possible solution. Common tools include greedy methods for set cover and submodular maximization, linear-programming relaxations with rounding for clustering and graph problems, and randomized, streaming, or coreset methods for large or changing inputs. Researchers also develop PTAS and FPTAS schemes for restricted settings and prove hardness bounds that show when stronger guarantees are unlikely, across problems such as fair clustering, facility location, scheduling, allocation, and robot motion planning. A central tension is balancing worst-case guarantees with practical speed, scalability, and constraints such as fairness, online decisions, or imperfect predictions.
Latest papers
102 papers13 papers in the last four weeks, down 19% on the four weeks before. 0.1% of all new papers.
Precedence-Constrained Decision Trees and Coverings
On the Hardness of Approximation of the Fair k-Center Problem
Learning to Approximate Uniform Facility Location via Graph Neural Networks
Incremental (k, z)-Clustering on Graphs
Exact and Approximate Range Queries in Ball Mapper
Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
Theoretical Analysis of Byte-Pair Encoding
Faster and Simpler Greedy Algorithm for -Median and -Means
Measuring Model-Induced Discrimination via Efficient Fairness Approximation
harmonic fairness via manifolds (HFM)'' based on distances between sets. Yet the direct calculation of distances might be too expensive to afford, reducing its practical applicability. Therefore, we devise an approximation algorithm named Approximation of distance between sets (ApproxDist)'' to facilitate accurate estimation of distances, and we further demonstrate its algorithmic effectiveness under certain reasonable assumptions. Empirical results indicate that the proposed fairness measure HFM reflects bias from both individual and group fairness aspects and that the proposed ApproxDist is effective and efficient.