## Proof that vertex cover is NP complete

Prerequisite – Vertex Cover Problem, NP-Completeness Problem – Given a graph G(V, E) and a positive integer k, the problem is to find whether there… Read More »

## Traveling Salesman Problem (TSP) Implementation

Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route… Read More »

## Exact Cover Problem and Algorithm X | Set 2 (Implementation with DLX)

In the article Exact Cover Problem and Algorithm X | Set 1 we discussed the Exact Cover problem and Algorithm X to solve the Exact… Read More »

## Exact Cover Problem and Algorithm X | Set 1

If you have ever tried to create a program for solving Sudoku, you might have come across the Exact Cover problem. In this article, we… Read More »

## Shortest Superstring Problem

Given a set of n strings arr[], find the smallest string that contains each string in the given set as substring. We may assume that… Read More »

## Set Cover Problem | Set 1 (Greedy Approximate Algorithm)

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 »

## Vertex Cover Problem | Set 2 (Dynamic Programming Solution for Tree)

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’… Read More »

## Vertex Cover Problem | Set 1 (Introduction and Approximate Algorithm)

A vertex cover of an undirected graph is a subset of its vertices such that for every edge (u, v) of the graph, either ‘u’… Read More »

## Travelling Salesman Problem | Set 2 (Approximate using MST)

We introduced Travelling Salesman Problem and discussed Naive and Dynamic Programming Solutions for the problem in the previous post,. Both of the solutions are infeasible.… Read More »

## Travelling Salesman Problem | Set 1 (Naive and Dynamic Programming)

Travelling Salesman Problem (TSP): Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route… Read More »

## NP-Completeness | Set 1 (Introduction)

We have been writing about efficient algorithms to solve complex problems, like shortest path, Euler graph, minimum spanning tree, etc. Those were all success stories… Read More »