The paper resolves the approximability of the Minimum Linear Ordering Problem for a general submodular function.

This paper shows that no reasonable approximation exists for A/E-design under partition constraints, contrasting the known guarantees for D-design.

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.

The Euclidean shortest vector problem is deterministically NP-hard to approximate within any constant factor for arbitrary constants.

This paper presents a polynomial time algorithm for maximizing the number of satisfied constraints in a boolean constraint satisfaction problem, achieving a $(k/2^k)$-approximation.

The paper shows that finding a median under Ulam distance for four permutations is NP-hard, improving upon previous results.

The paper defines and studies the complexity classes for quantum approximation algorithms and establishes a hierarchy of quantum approximation classes.

The authors improve bounds on how well polynomials can approximate the discrete log function.

This paper presents an initialization framework and rounding procedure for interior point methods in linear programming, ensuring strongly polynomial time complexity.