Approximating Clique and Biclique Problems

This publication has 12 references indexed in Scilit:

• Computing vertex connectivity: new bounds from old techniques
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
  SIAM Journal on Computing, 1996
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
  SIAM Journal on Computing, 1994
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
  Journal of Algorithms, 1994
• Multiway cuts in directed and node weighted graphs
  Lecture Notes in Computer Science, 1994
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
  Mathematical Programming, 1993
• A new approach to the maximum-flow problem
  Journal of the ACM, 1988
• Efficient bounds for the stable set, vertex cover and set packing problems
  Discrete Applied Mathematics, 1983
• A linear-time approximation algorithm for the weighted vertex cover problem
  Journal of Algorithms, 1981
• Edge-Deletion Problems
  SIAM Journal on Computing, 1981