This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ∑ v i i ∈ F Earliest fnish time will not work (Greedy algorithms won’t work) Solved by dynamic programming “Greedy stays ahead without the greediness.” ±or t = 0, 1, 2, . .., T fnd the best schedule ±or the subinterval end±or (3) Maximum Matching Input. A bipartite graph Output. A matching (a set o± edges with distinct vertices) o± maximum cardinality 62 Solution uses maxf ow (4) Maximum independent set Input: An undirected graph G = (GE) Output: An independent set oF max cardinality (set oF vertices with no edge between them) Brute ±orce: O(k 2 n 2 ) Best known O(n 0.79. ..k + O(1) ) Polytime algo? Equiv’t P = NP (5) Competitive Facility Location: Input: A graph with vertex weights w i ≥ A: 15 + 10 B: 10 Does player B have a strategy that guarantees ≥ p points? PSPACEhard 63...
View
Full
Document
This note was uploaded on 10/02/2008 for the course CS 482 taught by Professor Kleinberg during the Spring '08 term at Cornell University (Engineering School).
 Spring '08
 KLEINBERG
 Algorithms, Sort

Click to edit the document details