• Graduate program
    • Why Tinbergen Institute?
    • Program Structure
    • Courses
    • Course Registration
    • Facilities
    • Admissions
    • Recent PhD Placements
  • Research
  • News
  • Events
    • Summer School
      • Behavioral Macro and Complexity
      • Econometrics and Data Science Methods for Business and Economics and Finance
      • Inequalities in Health and Healthcare
      • Introduction in Genome-Wide Data Analysis
      • Research on Productivity, Trade, and Growth
      • Summer School Business Data Science Program
    • Events Calendar
    • Tinbergen Institute Lectures
    • Annual Tinbergen Institute Conference
    • Events Archive
  • Summer School
  • Alumni
  • Times

13-122/III - Sequential Monte Carlo for Counting Vertex Covers in General Graphs


  • Authors
    Radislav Vaisman, Technion, Haifa, Israel; Zdravko Botev, University of New South Wales, Sidney, Australia; Ad Ridder, VU University Amsterdam
  • Publication date
    August 26, 2013
  • Keywords
    Vertex Cover, Counting problem, Sequential importance sampling, Dynamic Programming, Relaxation, Random Graphs
  • JEL
    C61, C63