Code Directory
 Visual Basic & VB.NET
New Code
Bytescout BarCode Reader SDK
IP2Location Geolocation Database 2017
Best Spotify Open Source Clone Script 1.0
Flipkart Clone Script 4.0.5
Database Converters for Windows 3.15
Hotelline PMS 1.2
Devart T4 Editor 1.0
dbForge Studio for SQL Server 5.5
Extreme Injector 3.7
Kickstarter Clone Script 1.0.2
Etsy Clone Script 1.0.2
ByteScout PDF Extractor SDK
SQL Formatter for SQL Server 1.0
Database Workbench Pro 5.3.2
Paypal Clone Script 1.0.9
Top Code
Training Manager App 1.0
MATLAB Support Package for Arduino (aka ArduinoIO Package) 1.0
Event Portal 1.0
nml m3u playlist convert 1.0
Simulink Support Package for Arduino Uno Hardware 1.0
Top Rated
Get Random Record Based on Weight 1.0.0
Magento Product Designer 1.0
OFOS - Just Eat Clone Script 1.0
PrestaShop Upload Images Module 1.2.1
Trading Software 1.2.4
Solid File System OS edition 5.1
Classified Ad Lister 1.0
Aglowsoft SQL Query Tools 8.2
Sine Wave Using JavaFX 1.0
ICPennyBid Penny Auction Script 4.0
PHP Review Script 1.0
ATN Resume Finder 2.0
ATN Site Builder 3.0
Readymade MLM Software 2.02
Availability Booking Calendar PHP 1.0
Greedy algorithm for Set Cover problem 1.0
File ID: 78693

Greedy algorithm for Set Cover problem 1.0
Download Greedy algorithm for Set Cover problem 1.0http://www.mathworks.comReport Error Link
License: Freeware
File Size: 10.0 KB
Downloads: 485
User Rating:2 Stars  (2 ratings)
Submit Rating:
Greedy algorithm for Set Cover problem 1.0 Description
Description: This function contains the well known greedy algorithm for solving Set Cover problem (ChvdodAtal, 1979), with two small modifications:
* In case of more than one possible choice at a certain step, the biggest set is chosen;
* Once the solution is found, we check the selected sets to find a better cover solution, removing a set if is a subset of the union of the other set.

If you use this code, please cite the article for which it was implemented:
F. Gori, G. Folino, M.S.M. Jetten, E. Marchiori
"MTR: Taxonomic annotation of short metagenomic reads using clustering at multiple taxonomic ranks", Bioinformatics 2010.
doi = 10.1093/bioinformatics/btq649


Additional information:

GREEDYSCP Greedy SCP algorithm.
[SolC,SolL] = GREEDYSCP(C, L) if C is an array, creates a cell array SolC that is a solution of Set Cover Problem defined by C, where C{i} = S_i, an input set made by some of the elements we want to cover; SolC is made by the cells of C selected by the algorithm. The elements that we want to cover are indicates by numbers from 1 to n, where n is the number of elements we want to cover; therefore, C{i} is a vector of integers between 1 and n.

If C is a logical or numerical array of n rows, where C(j,i) > 0 iff element j is contained in set S_i, the output SolC will be a logical array made by the column of log(C) corresponding to the solution

If a vector L of integer labels of the elements of C is provided, SolL contains the labels corresponding to SolC. Otherwise SolL contains the positions of elements of SolC in C. SolC and SolL elements are sorted in ascending order of SolL.

License: Freeware

Related: Multiple, cover, biggest set, bioinformatics doi, ascending order, Article, array creates, array made, Array, array solc, numbers, by some, choice, chosen, chv tal, ci 3d, Check, Step, by the, Case

O/S:BSD, Linux, Solaris, Mac OS X

File Size: 10.0 KB

Downloads: 485

More Similar Code

The Jonker-Volgenant algorithm is much faster than the famous Hungarian algorithm for the Linear Assignment Problem (LAP). This Matlab implementation is modified from the original C++ code made by Roy Jonker, one of the inventors of the algorithm. It is about 10 times faster than the munkres code (v2.2) of the author. It can solve a 1000 x 1000 problem in about 3 seconds in a normal Intel Centrino processor.

V1.1 returns the dual...

findMIS is an heuristic algorithm for solving Maximum Independent Set problem (MIS).
An independent set of a graph is a subset of vertices in which no two vertices are
adjacent. Given a set of vertices, the maximum independent set...

This is an application of the Greedy Algorithm and the Local Search for finding a solution for the SC Distribution Network problem.
We dealt with one level SC composed of a set of factories and a set of Sales Points, each sales point has a...

A simple and fast algorithm for generating doubly-stochasstic matrices.
(matrices, where the sum of each column and each row is exactly 1).
Each matrix is chosen uniformly from the space of all NxN doubly-stochasstic

Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.
Multilayer Perceptron Neural Network Model and Backpropagation Algorithm for Simulink.

Marcelo Augusto Costa Fernandes

Vibterbi algorithm for HMM inference
Viterbi algorithm based on the Python code found at:

Also included is an example based on the one from the Wikipedia page.

The code is...

3D reconstruction algorithm for electron cryo-microscopy
Traditional single particle reconstruction methods use either the Fourier or the delta function basis to represent the particle density map. We propose a more flexible algorithm that...

The Radial Basis Function (RBF) with LMS algorithm for Simulink.
The Radial Basis Function (RBF)
Batch-mode training
Fixed centers selected at random
The Gaussian basis functions
Computing the output weights with LMS...

Application to test a GA solution for the Knapsack problem, it will compare Genetic Algorithm solution of the Knapsack problem to greedy algorithm.

Non Convex Optimization Algorithms for Group Sparsity
Solves a dummy OFDM sparse channel estimation problem

Reweighted Lm,p algorithm for noiseless case
min||x||_m,p s.t. y = Ax

Reweighted Lm,p algorithm for noisy...

User Review for Greedy algorithm for Set Cover problem
- required fields

Please enter text on the image