Approximating the least hypervolume contributor: NP-hard in general, but fast in practice

Approximating the minimum directed tree cover

Approximating the Minimum Equivalent Digraph

Approximating the Online Set Multicover Problems Via Randomized Winnowing

Approximating the Statistics of various Properties in Randomly Weighted Graphs

Approximating Vertex Cover in Dense Hypergraphs

Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits

Approximation Algorithms for Covering/Packing Integer Programs

Approximation Algorithms for Directed Width Parameters

Approximation Algorithms for Edge Partitioned Vertex Cover Problems

Approximation Algorithms for Key Management in Secure Multicast

Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

Approximation Algorithms for Orienteering with Time Windows

Approximation Algorithms for Restless Bandit Problems

Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions

Approximation Algorithms for Secondary Spectrum Auctions

Approximation Algorithms for Submodular Multiway Partition