HW on CS 412

NP Complete Project Problem Specification

Mon, 01 Jan 0001 00:00:00 +0000

This document outlines the input and output specifications for each NP-complete problem. For each problem, sample input and output are provided.

Weighted Graph Problems (TSP, Longest Path)

For traveling sales person, the names of the two programs are:

cs412_tsp_exact.py
cs412_tsp_approx.py

For the longest path problem, the names of the two programs are:

cs412_longestpath_exact.py
cs412_longestpath_approx.py

The input is a weighted graph specified by a line containing the number of vertices n and the number of edges m followed by m lines containing the edges given in u v w format, representing an edge between u and v of weight w. TSP graphs are undirected and edges will be listed only once and the graph will be a complete graph. LP graphs are undirected and edges will be listed once (but it is not necessarily a complete graph).

NP Complete Project Problem Specification

Mon, 01 Jan 0001 00:00:00 +0000

This document outlines the input and output specifications for each NP-complete problem as well as file naming standards. For each problem, sample input and output are provided.

Problem | Prefix Traveling Salesperson | tsp_ Longest Path | fp_

Project Options

Mon, 01 Jan 0001 00:00:00 +0000

Project Options

MAX 3-SAT

Solve Problem using Independent Set Approximation

For this option, you must develop code that transforms the 3-SAT input into input for the independent set problem (in a polynomial number of steps). Many examples of how to do this are in publication, you just need to implement one of them and discuss how it works.

You can then use the instructor provided approximation algorithm for independent set and compare it to how your team’s approximation method (part D) performs.