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

CardsList

102 papers13 papers in the last four weeks, down 19% on the four weeks before. 0.1% of all new papers.

  1. Better Learning-Augmented Spanning Tree Algorithms via Metric Forest Completion

    Feb 27, 2026Nate Veldt, Thomas Stanley, Benjamin W. Priest +5Learning-Augmented AlgorithmsApproximation Algorithms

  2. Precedence-Constrained Decision Trees and Coverings

    Feb 24, 2026Michał Szyfelbein, Dariusz DereniowskiCombinatorial OptimizationConstrained Optimization

  3. On the Hardness of Approximation of the Fair k-Center Problem

    Feb 18, 2026Suhas ThejaswiApproximation AlgorithmsClustering

  4. Learning to Approximate Uniform Facility Location via Graph Neural Networks

    Feb 13, 2026Chendi Qian, Christopher Morris, Stefanie Jegelka +1Graph Neural NetworksCombinatorial Optimization

  5. Incremental (k, z)-Clustering on Graphs

    Feb 9, 2026Emilio Cruciani, Sebastian Forster, Antonis SkarlatosClusteringGraph Clustering

  6. Exact and Approximate Range Queries in Ball Mapper

    Jan 4, 2026Jay-Anne Bulauan, John Rick ManzanaresApproximation AlgorithmsTopological Data Analysis

  7. Theoretical Analysis of Byte-Pair Encoding

    Nov 13, 2024László Kozma, Johannes VoderholzerByte-Pair EncodingSubword Tokenization

  8. Measuring Model-Induced Discrimination via Efficient Fairness Approximation

    May 15, 2024Yijun Bian, Yujie LuoAlgorithmic FairnessGroup Fairness

  9. Supermodular Rank: Set Function Decomposition and Optimization

    May 24, 2023Rishi Sonthalia, Anna Seigal, Guido MontufarSubmodular OptimizationApproximation Algorithms

  10. Proportionally Representative Clustering

    Apr 27, 2023Haris Aziz, Barton E. Lee, Sean Morota Chu +1ClusteringAlgorithmic Fairness