David B. Shmoys Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. [Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:15-32 [Conf]

Reuven Bar-Yehuda One for the Price of Two: A Unified Approach for Approximating Covering Problems. [Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:49-62 [Conf]

Maxim Sviridenko Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP] APPROX, 1998, pp:193-199 [Conf]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP