Lec4_RandomAlgs

# Lec4_RandomAlgs - COT 6936 Topics in Algorithms Giri Narasimhan ECS 254A EC 2443 Phone x3748 [email protected]/* <![CDATA[ */!function(t,e,r,n,c,a,p){try{t=document.currentScript||function(){for(t=document.getElementsByTagName('script'),e=t.length;e--;)if(t[e].getAttribute('data-cfhash'))return t[e]}();if(t&&(c=t.previousSibling)){p=t.parentNode;if(a=c.getAttribute('data-cfemail')){for(e='',r='0x'+a.substr(0,2)|0,n=2;a.length-n;n+=2)e+='%'+('0'+('0x'+a.substr(n,2)^r).toString(16)).slice(-2);p.replaceChild(document.createTextNode(decodeURIComponent(e)),c)}p.removeChild(t)}}catch(u){}}()/* ]]> */

This preview shows pages 1–8. Sign up to view the full content.

COT 6936: Topics in Algorithms Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 [email protected] http://www.cs.fiu.edu/~giri/teach/COT6936_S12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id= 174

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Polynomial-time algorithms for LP • Simplex is not poly-time in the worst-case • Khachiyan’s ellipsoid algorithm: LP is in P • Karmarkar’s interior-point algorithm • Good implementations for LP exist – Works very well in practice – More competitive than the poly-time methods for LP 2/8/12 COT 6936 2
COT 6936: Topics in Algorithms Integer Linear Programming

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Integer Linear Programming • LP with integral solutions • NP-hard • If A is a totally unimodular matrix , then the LP solution is always integral. – A TUM is a matrix for which every nonsingular submatrix has determinant 0, +1 or -1. – A TUM is a matrix for which every nonsingular submatrix has integral inverse. 2/8/12 COT 6936 4
Vertex Cover as an LP? • For vertex v, create variable x v • For edge (u,v), create constraint x u + x v 1 • Objective function : Σ x v • Additional constraints : x v 1 • Doesn’t work because x v needs to be from {0,1} 2/8/12 COT 6936 5

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Set Cover • Given a universe of items U = {e 1 , …, e n } and a collection of subsets S = {S 1 , …, S m } such that each S i is contained in U • Find the minimum set of subsets from S that will cover all items in U (i.e., the union of these subsets must equal U) • Weighted Set Cover : Given universe U and collection S, and a cost c(S i ) for each subset S i in S, find the minimum cost set cover 2/8/12 COT 6936 6
COT 6936 7

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/18/2012 for the course CIS 6936 taught by Professor Giri during the Spring '12 term at FIU.

### Page1 / 30

Lec4_RandomAlgs - COT 6936 Topics in Algorithms Giri Narasimhan ECS 254A EC 2443 Phone x3748 [email protected]

This preview shows document pages 1 - 8. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online