CSE550 Combinatorial Algorithms/Intractability

From esoterum.org
Revision as of 22:28, 12 November 2007 by Baker (Talk | contribs)

Jump to: navigation, search

HW 6

1. 2-SAT is in NP
2. A sub-optimal solution to TSP is a Hamiltonian Cycle.
4. Finding disjoint paths with different path-costs: Complexity and algorithms


Midterm

Q1


Q4