'Approximation ratio' presentation slideshows

Approximation Algorithms for Stochastic Combinatorial Optimization

Approximation Algorithms for Stochastic Combinatorial Optimization. R. Ravi Carnegie Mellon University Joint work with: Kedar Dhamdhere, CMU -> Google Labs, CA Anupam Gupta, CMU Martin Pal, DIMACS -> Google Labs, NY Mohit Singh, CMU Amitabh Sinha, CMU -> U. Michigan

1.43k views • 128 slides

UET Multiprocessor Scheduling Problems

UET Multiprocessor Scheduling Problems. Nan Zang nzang@cs.ucsd.edu. Overview of the paper. Introduction Classification Complexity results for Pm | prec, p j = 1 | C max Algorithms for Pk | prec, p j = 1 | C max Future research directions and conclusions. Scheduling.

805 views • 65 slides

Outline

721 views • 61 slides

Online Broadcast Scheduling New Perspectives and Results

Online Broadcast Scheduling New Perspectives and Results . Chandra Chekuri University of Illinois. Online Broadcast Scheduling New Perspectives and Results . Chandra Chekuri University of Illinois. Sungjin Im. Ben Moseley. Goals of Talk.

644 views • 55 slides

Greedy Algorithms

Greedy Algorithms. CS 466 Saurabh Sinha. Chapter 5.5. A greedy approach to the motif finding problem. Given t sequences of length n each, to find a profile matrix of length l . Enumerative approach O( l n t ) Impractical?

804 views • 49 slides

Lecturer: Moni Naor

Algorithmic Game Theory Uri Feige Robi Krauthgamer Moni Naor Lecture 11: Combinatorial Auctions. Lecturer: Moni Naor. Announcements. Course resumes to 1400:-16:00 . The setting. Set of alternatives A Who wins the auction Which path is chosen Who is matched to whom

632 views • 47 slides

Achieving Anonymity via Clustering

Achieving Anonymity via Clustering. G. Aggarwal, T. Feder, K. Kenthapadi, S. Khuller, R. Panigrahy, D. Thomas , A. Zhu. Talk outline. k-Anonymity model Achieving Anonymity via Clustering r-Gather clustering Cellular clustering Future Work. Medical Records. De-identified Medical Records.

426 views • 33 slides

Approximation Algorithms for MAX-MIN tiling

Approximation Algorithms for MAX-MIN tiling. Authors Piotr Berman, Bhaskar DasGupta, S. Muthukrishman Published on Journal of Algorithms, 2003 Presented by Sera Kahruman. Outline. Definition Approximation algorithms Greedy Slice and Dice

501 views • 28 slides

Reconstructing approximate phylogenetic trees from quartet samples

354 views • 25 slides

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????. ?????? ????????? ??? ?????????????? http://www.di.uoa.gr/~telelis/opt.html ????? ???????????? ??? ???????????????, ????. ???? ??????????.

311 views • 24 slides

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????. ?????????? ??????? ??? ????????????? (???, ????). ???? ??????????.

338 views • 24 slides

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????

?? ???????? Routing and Path Coloring ??? ?? ????????? ??? ?? ?????? ?????? ??????. ?????? ????????? ??? ?????????????? http://www.di.uoa.gr/~telelis/opt.html ????? ???????????? ??? ???????????????, ????. ???? ??????????.

329 views • 24 slides

Polynomial Time Approximation Schemes and Parameterized Complexity

Polynomial Time Approximation Schemes and Parameterized Complexity. Jianer Chen Texas A&M University. Joint work with Xiuzhen Huang, Ge Xia, and I. Kanj. Approximation Algorithms and Parameterized Algorithms. Assuming P ? NP

379 views • 22 slides

Broadcast Scheduling in Mobile Ad Hoc Networks

405 views • 22 slides

Advanced Approximation Algorithms II

Advanced Approximation Algorithms II. How to find a heavy weight cut in a graph. The MAX CUT Problem.

303 views • 18 slides

Paths, Trees and Minimum Latency Tours

Paths, Trees and Minimum Latency Tours. Kamalika Chaudhuri , Brighten Godfrey, Satish Rao, Kunal Talwar UC Berkeley. The Problem. Given: V: Set of points d : Distance function on pairs of points s : Starting point

269 views • 17 slides

Approximating Fault-Tolerant Domination in General Graphs

268 views • 17 slides

Online Social Networks and Media

Online Social Networks and Media . Influence Maximization. Maximizing spread. Suppose that instead of a virus we have an item (product, idea, video) that propagates through contact Word of mouth propagation . An advertiser is interested in maximizing the spread of the item in the network

268 views • 14 slides

Approximating Maximum Subgraphs Without Short Cycles

Approximating Maximum Subgraphs Without Short Cycles. Guy Kortsarz Join work with Michael Langberg and Zeev Nutov. Max-g-Girth. Girth: A graph G is said to have girth g if its shortest cycle is of length g .

239 views • 14 slides

Hamiltonian Cycle and TSP

Hamiltonian Cycle and TSP. Hamiltonian Cycle: given an undirected graph G find a tour which visits each point exactly once Traveling Salesperson Problem given a positive weighted undirected graph G (with triangle inequality = can make shortcuts)

745 views • 7 slides