Skip to content

Text Set Cover Problem - Statistical and Deterministic approaches in comparison with simmulated-annealing and greedy algorithms.

Notifications You must be signed in to change notification settings

dramsauer/Text-Coverage-Problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Comparison of solution approaches for the Set Cover Problem

Abstract

The Set Cover Problem is a research issue in computer science with a lot of applications e.g. in machine learning, data mining and information retrieval. It is about selecting as few sets as possible from a collection that cover some universe. The aim of this project is to compare two approaches - a deterministic one and a statistical - and to rate them by concerns of coverage rate and computation time.

About

Text Set Cover Problem - Statistical and Deterministic approaches in comparison with simmulated-annealing and greedy algorithms.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published