'Set cover problem' presentation slideshows

MCS 312: NP Completeness and Approximation algorthms

732 views • 61 slides

Optimization problems

Optimization problems. INSTANCE FEASIBLE SOLUTIONS COST. Vertex Cover problem. INSTANCE graph G FEASIBLE SOLUTIONS S ? V, such that ( ? e ? E) S ? e ?0 COST c(S) = |S|. Set Cover problem. INSTANCE family of sets A 1 ,...,A n ? ? FEASIBLE SOLUTIONS

492 views • 47 slides

Topical Query Decomposition

Topical Query Decomposition. Francesco Bonchi Carlos Castillo Debora Donato Aristides Gionis Yahoo! Research Barcelona, Spain KDD 08. Abstract. Given a query and a document retrieval system

332 views • 22 slides

Computational problems, algorithms, runtime, hardness

391 views • 19 slides

CPS 196.2

299 views • 16 slides

On approximation algorithms for the terminal Steiner tree problem

On approximation algorithms for the terminal Steiner tree problem. Doratha E. Drake, Stefan Hougardy Information Processing Letters 89(2004) 15-18. Reporter: Cheng-Chung,Li 2004/04/19. Outline. Introduction The hardness result The approximation algorithm. Introduction-(1).

292 views • 11 slides