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. Informative Path Planning with Gaussian Processes: Error Bounds, Algorithms, and Benchmarks

    Nov 12, 2026Kalvik Jakkala, Jennifer Wakulicz, Donald G. Dansereau +3Informative Path PlanningApproximation Algorithms

  2. Sparse PCA with Overlapping Supports: NP-Hardness and an FPTAS

    Nov 11, 2026Alberto Del Pia, Dekun ZhouPrincipal Component AnalysisApproximation Algorithms

  3. Tokenization: Hardness and Bicriteria Approximation Algorithms

    Nov 11, 2026Atieh Bastan, Xiaoling He, A. Pavan +1TokenizationApproximation Algorithms

  4. Pair-Merge Tokenisation Is Hard to Approximate on Binary Strings and Strongly NP-Hard on Unary Datasets

    Nov 10, 2026Kundan Baliga, Aiden Xie, Aditya ByjuTokenizationByte-Pair Encoding

  5. Beyond the First Hit: Towards Tight Guarantees for kk-means++

    Nov 9, 2026Aravind ReddyClusteringApproximation Algorithms

  6. Fast Approximate ℓp\ell_p Chamfer Distance via Lopsided Embeddings and Structured JL

    Nov 8, 2026Ying Feng, David P. WoodruffApproximation Algorithms

  7. Greedy Byte-Pair Encoding Achieves 0.391 of the Optimum, Past the One-Third Barrier for Packing-Based Analyses

    Nov 5, 2026Kundan Baliga, Aiden Xie, Aditya ByjuByte-Pair EncodingLossless Data Compression

  8. Consistent Submodular Maximization with Full Foresight

    Nov 4, 2026Eric Balkanski, Paul Dütting, Federico Fusco +4Online Submodular OptimizationSubmodular Optimization

  9. Improved approximation algorithms for capacitated cluster editing

    Nov 4, 2026Cong Ma, Guangting Chen, Yong Chen +3Correlation ClusteringApproximation Algorithms

  10. On Worst-Case Guarantees for Graph-Based Nearest-Neighbor Search

    Oct 28, 2026Majid Daliri, Mohammadreza Daneshvaramoli, Purna Dutta +4Approximate Nearest Neighbor SearchGraph-Based Retrieval

  11. When Weak Submodularity Meets Matroids: How Does Standard Greedy Behave?

    Oct 18, 2026Qixin Zhang, Shi Fu, Shengminjie Chen +2Greedy OptimizationSubmodular Optimization

  12. FPTAS for Polygonal Multi-Robot Motion Planning

    Oct 14, 2026Sayan Bandyapadhyay, William Lochet, Saket Saurabh +1Multi-Robot Motion PlanningMotion Planning

  13. Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player Bandits

    Oct 13, 2026Sacha Arroues-Paykin, Etienne Boursier, Vianney PerchetMulti-Armed BanditsMulti-Agent Bandits

  14. Improving the Bounds on Approximating Weighted Maximin Share for Chores

    Oct 11, 2026Trung Thanh Nguyen, Khaled Elbassioni, Jörg RotheFair Resource AllocationApproximation Algorithms

  15. Minimizing Cumulative Envy in Allocating a Sequence of Items

    Oct 7, 2026Paul W. Goldberg, Isaac Robinson, Nicholas TehFair Resource AllocationApproximation Algorithms

  16. Settling the Computational Complexity of Max-Min Allocation with Ternary Valuations

    Oct 4, 2026Thi Ngoc Anh Vu, Trung Thanh Nguyen, Khaled Elbassioni +1Submodular OptimizationSocial Choice Theory

  17. Maximizing pp-Mean Social Welfare in the High-Multiplicity Setting: Few Agent Types and Few Item Types

    Oct 3, 2026Trung Thanh Nguyen, Khaled ElbassioniSocial Welfare MaximizationFair Resource Allocation

  18. Streaming algorithms for robust max-min diversification

    Oct 1, 2026Andrea Pietracaprina, Geppino Pucci, Stefano ZanonCoreset SelectionApproximation Algorithms

  19. Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon

    Sep 30, 2026Johannes F. Loevenich, Thies Moehlenhof, Laurin Holz +3Graph Neural NetworksApproximation Algorithms

  20. Poisson Exchange Beyond Submodularity: Effective Approximation Algorithms for Offline and Online Subset Selection over Matroids

    Sep 21, 2026Shi Fu, Youming Qiao, Dacheng Tao +2Submodular OptimizationCombinatorial Optimization

  21. A Horizon-slicing Approach to Minimum Obstacle Displacement Planning for Robot Navigation

    Sep 19, 2026Antony Thomas, Giulio Ferro, Fulvio Mastrogiovanni +2Motion PlanningRobot Motion Planning