On the approximation of maximum satisfiability
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A (&Dgr;/2)-approximation algorithm for the maximum independent set problem
Information Processing Letters
The NP-completeness column: an ongoing guide
Journal of Algorithms
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Some Further Approximation Algorithms for the Vertex Cover Problem
CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Greed is good: approximating independent sets in sparse and bounded-degree graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximations of independent sets in bounded-degree graphs via subgraph removal
Nordic Journal of Computing
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
1.375-Approximation Algorithm for Sorting by Reversals
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the complexity of approximating k-set packing
Computational Complexity
Independent sets in bounded-degree hypergraphs
Discrete Applied Mathematics
Combinatorics, Probability and Computing
The greedier the better: an efficient algorithm for approximating maximum independent set
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
On linear and semidefinite programming relaxations for hypergraph matching
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On sorting permutations by double-cut-and-joins
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Independent sets in bounded-degree hypergraphs
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Large neighborhood local search for the maximum set packing problem
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |