##
Greedy Algorithms | Set 9 (Boruvka’s algorithm)
May 20, 2015

We have discussed following topics on Minimum Spanning Tree. Applications of Minimum Spanning Tree Problem Kruskal’s Minimum Spanning Tree Algorithm

May 20, 2015

We have discussed following topics on Minimum Spanning Tree. Applications of Minimum Spanning Tree Problem Kruskal’s Minimum Spanning Tree Algorithm

March 27, 2015

Given a universe U of n elements, a collection of subsets of U say S = {S1, S2…,Sm} where every subset Si has an associated… Read More »

March 26, 2015

Given n cities and distances between every pair of cities, select k cities to place warehouses (or ATMs or Cloud Server) such that the maximum… Read More »

February 4, 2015

Every positive fraction can be represented as sum of unique unit fractions. A fraction is unit fraction if numerator is 1 and denominator is a… Read More »

January 4, 2015

Given a number of friends who have to give or take some amount of money from one another. Design an algorithm by which the total… Read More »

November 18, 2014

Given an array of jobs where every job has a deadline and associated profit if the job is finished before the deadline.

November 16, 2014

Given arrival and departure times of all trains that reach a railway station, find the minimum number of platforms required for the railway station so… Read More »

August 17, 2014

There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal… Read More »

March 7, 2014

Given a string and a positive integer d. Some characters may be repeated in the given string.

November 14, 2013

We introduced graph coloring and applications in previous post. As discussed in the previous post, graph coloring is widely used.

November 27, 2012

We recommend to read following two posts as a prerequisite of this post. 1. Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm) 2. Graph and… Read More »

November 25, 2012

Given a graph and a source vertex in graph, find shortest paths from source to all vertices in the given graph.

November 23, 2012

We recommend to read following two posts as a prerequisite of this post.

November 18, 2012

We have discussed Kruskal’s algorithm for Minimum Spanning Tree. Like Kruskal’s algorithm, Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree.

November 4, 2012

We recommend to read following post as a prerequisite for this. Greedy Algorithms | Set 3 (Huffman Coding) Time complexity of the algorithm discussed in… Read More »