Approximation Algorithms for Finding Highly Connected Subgraphs

  • Samir KhullerDept
  • Published 1996
This chapter is dedicated to Prof. Richard Karp whose Turing Award Lecture \Combinatorics, Complexity and Randomness" (Communications of the ACM, Feb 1986) inspired this author to start working in the eld of algorithms.