PPT-Bounded Approximation Algorithms

Author : tatyana-admore | Published Date : 2016-06-15

Sometimes we can handle NP problems with polynomial time algorithms which are guaranteed to return a solution within some specific bound of the optimal solution

Presentation Embed Code

Download Presentation

Download Presentation The PPT/PDF document "Bounded Approximation Algorithms" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

Bounded Approximation Algorithms: Transcript

Sometimes we can handle NP problems with polynomial time algorithms which are guaranteed to return a solution within some specific bound of the optimal solution within a constant c of the optimal. Prasad . Raghavendra. . Ning. Chen C. . . Thach. . Nguyen . . . Atri. . Rudra. . . Gyanit. Singh. University of Washington. Roee . Engelberg. Technion. University. Ravishankar. . Krishnaswamy. (joint work with Nikhil . Bansal. and . Barna. . Saha. ). Approximating Set Cover. Given . m sets, n elements. Find . minimum cost. collection of sets . to cover . Anupam. Gupta. Carnegie Mellon University. stochastic optimization. Question: . How to model uncertainty in the inputs?. data may not yet be available. obtaining exact data is difficult/expensive/time-consuming. 1. Tsvi. . Kopelowitz. Knapsack. Given: a set S of n objects with weights and values, and a weight bound:. w. 1. , w. 2. , …, w. n. , B (weights, weight bound).. v. 1. , v. 2. , …, v. n. (values - profit).. Alexander . Veniaminovich. IM. , . room. . 3. 44. Friday. 1. 7. :00. or. Saturday 14:30. Approximation. . algorithms. . 2. We will study. . NP. -. hard optimization problem. 3. What you should know. Blum, . Chawla. , . Karger. , Lane, . Meyerson. , . Minkoff. CS 599: Sequential. Decision Making in Robotics. University. of Southern California. Spring. 2011. TSP: Traveling Salesperson Problem. Graph V, E. Lecture 12. Constantinos Daskalakis. The Lemke-. Howson. Algorithm. The Lemke-. Howson. Algorithm (1964). Problem:. Find an exact equilibrium of a 2-player game.. Since there exists a rational equilibrium this task is feasible.. Algorithms. and Networks 2015/2016. Hans L. . Bodlaender. Johan M. M. van Rooij. TexPoint fonts used in EMF. . Read the TexPoint manual before you delete this box.: . A. A. A. A. A. A. A. A. A. A. What to do if a problem is. Problem. Yan Lu. 2011-04-26. Klaus Jansen SODA 2009. CPSC669 Term Project—Paper Reading. 1. Problem Definition. 2. Approximation Scheme. 2.1 Instances with similar capacities. 2.2 General cases . Outline. Julia Chuzhoy. Toyota Technological Institute at Chicago. Routing Problems. Input. : Graph G, source-sink pairs (s. 1. ,t. 1. ),…,(. s. k. ,t. k. ).. Goal. : Route as many pairs as possible; minimize edge congestion.. Stochastic . Optimization. Anupam Gupta. Carnegie Mellon University. IPCO Summer . School. Approximation . Algorithms for. Multi-Stage Stochastic Optimization. {vertex cover, . S. teiner tree, MSTs}. When the best just isn’t possible. Jeff Chastine. Approximation Algorithms. Some NP-Complete problems are too important to ignore. Approaches:. If input small, run it anyway. Consider special cases that may run in polynomial time. Lecture 18. May 29, . 2014. May 29, 2014. 1. CS38 Lecture 18. May 29, 2014. CS38 Lecture 18. 2. Outline. coping with . intractibility. approximation algorithms. set cover. TSP. center selection. randomness in algorithms. Pravesh Kothari, . Divyarthi Mohan,. Ariel Schvartzman, . Sahil Singla, S. Matthew Weinberg. FOCS 2019. How to Maximize Revenue?. Selling a Single Item. ~ . . v(. ⚽. ). v(. ⚽. )= . x. Truthful Mechanism.

Download Document

Here is the link to download the presentation.
"Bounded Approximation Algorithms"The content belongs to its owner. You may download and print it for personal use, without modification, and keep all copyright notices. By downloading, you agree to these terms.