Online Algorithms. Lecture 11
|
|
- Kristopher Haynes
- 6 years ago
- Views:
Transcription
1 Online Algorithms Lecture 11
2 Today DC on trees DC on arbitrary metrics DC on circle Scheduling
3 K-server on trees Theorem The DC Algorithm is k-competitive for the k server problem on arbitrary tree metrics. Proof: = Lemma 1. Φ 0;5 Φ = k min - d s 0, o ( 0 ( * + Lemma 2. Φ 0 Φ 0; Φ 0;5 + k OPT 0 (σ) = DC 0 (σ) if 3; d(s 0, s 8 ) :5
4 10.1 k-server-problem on trees We consider the k-server-problem on trees. Let {o 1,...,o k } and {s 1,...,s k } be two sets of servers. We use the metric and the notion of neighborhood from the lecture. As previously an assignment is optimal if = argmin 2Sk P k i=1 d(x i,y (i) ). Let j 2 {1,...,k} be an arbitrary index and let I be the set of indices of the neighbors s i of o j. That is, I = {i s i is neighbor of o j }. Show that there is an optimal assignment with (i) =j for an i 2 I.
5 Applying the DC-Algorithm P Idea: Approximate an arbitrary metric with a tree metric Use the DC algorithm for trees Application of the DC algorithm Let G =(V,E) be a graph with edge weights w(e) and T =(V,E T ) be a minimum spanning tree (MST) of G. Show that for every e = {x, y} 2 E the distance from x to y in T is at most (n 1)w(e) where n = V. Use the DC algorithm on tree metrics and above insight to prove: There is a deterministic O(nk)- competitive algorithm for arbitrary metric spaces with n points. Corollary The DC-algorithm is (n 1)k-competitive for arbitrary metrics with n points.
6 Applying the DC-Algorithm (2) 10.3 DC on a Circle Consider the k-server-problem on a circle C with circumference 1. The distance d(x, y) of two points x, y 2 C is the length of the shortest arc between them. Describe a randomize online algorithm for the k-server problem on the metric space (C, d) that is 2k-competitive against oblivious adversaries. Hint: First show the following statement: If we cut the circle at a point p 2 C chosen uniformly at random and interpret the resulting arc C 0 as a line with the usual metric d 0 then for every two points x, y 2 C the following holds: E[d 0 (x, y)] apple 2d(x, y) where the expectation is taken over all points p 2 C.
7 Applying the DC-Algorithm (3) We saw two simple methods to approximate metric spaces by a tree metric Without decreasing distances Increasing distances only by a certain factor n for arbitrary metric spaces (deterministic) 2 for a circle metric (randomized) What is the best that we can achieve for arbitrary metric spaces?
8 Approximation of metric spaces There is a randomized algorithm to compute a distribution over tree metrics such that distances increase by a factor of O(log n) in expectation and do not decrease. Corollary There is a randomized online algorithm for the k server problem which is O(k logn)-competitive for arbitrary metrics with n points.
9 Makespan-Scheduling Set of jobs J = {1, n} Set of machines M = {1, m} Each job j J has a size p 8 R > 0 Each machine i M has a speed s 0 R > 0 If a job j J is processed by machine i M it takes time ]^ a _` A schedule π J M assigns each job to a machine L 0 (π) is the load of machine i M in schedule π j M,π(j)=i p 8 L 0 (π) = s 0 Makespan C(π) is the maximal load i.e. C π = max 0 j L 0(π) Objective: Find a schedule with minimal Makespan.
10 Online Scheduling Set of machines and speed are known. jobs arrive one after another. job have to be assigned immediately to a machine. number and size of future jobs are unknown. Example: 2 machines, each with speed 1 Sequence of jobs: 1, 1, (2)
11 Results for today Identical machines (all have speed 1) Least Loaded is strict (2 5 l )-competitive Matching lower bound for Least Loaded. Machines with speed Algorithm Slowfit(α) Algorithm Slowfit is strict 8-competitive
12 Slowfit(α) Assume we now the makespan of OPT. Let α = OPT(σ) slowfit(α) tries to compute a schedule with makespan at most 2α. 1. Sort machines according to speed in increasing order, i.e., s 5 s n s l 2. Let π 8 be the schedule of slowfit(α) for the jobs 1,, j. 3. slowfit(α) schedules a new job j with size p 8 to the slowest machine i = M which has load no more then 2α after this assignment. That is i = = min{i M L 0 (π 8;5 ) + ]^ 2α }. If no such machine exists, output an error. _`
13 Slowfit 1. Set α q = ] r _ s 2. Start with phase k = 0 3. For a job j do the following: a) try to schedule j with slowfit(α 3 ) while ignoring all jobs of previous rounds 0,, k 1 b) If slowfit(α 3 ) produces an error, increase k by one, Set α 3 = 2 3 α t, and Goto 3a).
COMP Online Algorithms. k-server Problem & Advice. Shahin Kamali. Lecture 13 - Oct. 24, 2017 University of Manitoba
COMP 7720 - Online Algorithms k-server Problem & Advice Shahin Kamali Lecture 13 - Oct. 24, 2017 University of Manitoba COMP 7720 - Online Algorithms k-server Problem & Advice 1 / 20 Review & Plan COMP
More informationThe k-server problem June 27, 2005
Sanders/van Stee: Approximations- und Online-Algorithmen 1 The k-server problem June 27, 2005 Problem definition Examples An offline algorithm A lower bound and the k-server conjecture The greedy algorithm
More informationApproximation Algorithms
Chapter 8 Approximation Algorithms Algorithm Theory WS 2016/17 Fabian Kuhn Approximation Algorithms Optimization appears everywhere in computer science We have seen many examples, e.g.: scheduling jobs
More informationAlgorithm Design and Analysis
Algorithm Design and Analysis LECTURE 29 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/7/2016 Approximation
More informationSolutions for the Exam 6 January 2014
Mastermath and LNMB Course: Discrete Optimization Solutions for the Exam 6 January 2014 Utrecht University, Educatorium, 13:30 16:30 The examination lasts 3 hours. Grading will be done before January 20,
More informationMetric Techniques and Approximation Algorithms. Anupam Gupta Carnegie Mellon University
Metric Techniques and Approximation Algorithms Anupam Gupta Carnegie Mellon University Metric space M = (V, d) set Vof points y z distances d(x,y) triangle inequality d(x,y) d(x,z) + d(z,y) x why metric
More informationCOMP Online Algorithms. Online Bin Packing. Shahin Kamali. Lecture 20 - Nov. 16th, 2017 University of Manitoba
COMP 7720 - Online Algorithms Online Bin Packing Shahin Kamali Lecture 20 - Nov. 16th, 2017 University of Manitoba COMP 7720 - Online Algorithms Online Bin Packing 1 / 24 Review & Plan COMP 7720 - Online
More informationval(y, I) α (9.0.2) α (9.0.3)
CS787: Advanced Algorithms Lecture 9: Approximation Algorithms In this lecture we will discuss some NP-complete optimization problems and give algorithms for solving them that produce a nearly optimal,
More informationCSC2420 Fall 2012: Algorithm Design, Analysis and Theory
CSC2420 Fall 2012: Algorithm Design, Analysis and Theory Allan Borodin September 20, 2012 1 / 1 Lecture 2 We continue where we left off last lecture, namely we are considering a PTAS for the the knapsack
More informationProblem Set 2 Solutions
Design and Analysis of Algorithms February, 01 Massachusetts Institute of Technology 6.046J/18.410J Profs. Dana Moshkovitz and Bruce Tidor Handout 8 Problem Set Solutions This problem set is due at 9:00pm
More informationCOMP Online Algorithms. List Update with Advice & Bin Packing. Shahin Kamali. Lecture 14 - Oct. 23, 2018 University of Manitoba
COMP 7720 - Online Algorithms List Update with Advice & Bin Packing Shahin Kamali Lecture 14 - Oct. 23, 2018 University of Manitoba COMP 7720 - Online Algorithms List Update with Advice & Bin Packing 1
More informationOn the Advice Complexity of Online Problems
On the Advice Complexity of Online Problems (Extended Abstract) Hans-Joachim Böckenhauer 1, Dennis Komm 1, Rastislav Královič 2, Richard Královič 1, and Tobias Mömke 1 1 Department of Computer Science,
More informationTheorem 2.9: nearest addition algorithm
There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used
More information6.889 Sublinear Time Algorithms February 25, Lecture 6
6.9 Sublinear Time Algorithms February 5, 019 Lecture 6 Lecturer: Ronitt Rubinfeld Scribe: Michal Shlapentokh-Rothman 1 Outline Today, we will discuss a general framework for testing minor-free properties
More informationJOB SHOP SCHEDULING WITH UNIT LENGTH TASKS
JOB SHOP SCHEDULING WITH UNIT LENGTH TASKS MEIKE AKVELD AND RAPHAEL BERNHARD Abstract. In this paper, we consider a class of scheduling problems that are among the fundamental optimization problems in
More informationAlgorithms for Grid Graphs in the MapReduce Model
University of Nebraska - Lincoln DigitalCommons@University of Nebraska - Lincoln Computer Science and Engineering: Theses, Dissertations, and Student Research Computer Science and Engineering, Department
More informationRandomized Optimization Problems on Hierarchically Separated Trees
Randomized Optimization Problems on Hierarchically Separated Trees Béla Csaba, Tom Plick and Ali Shokoufandeh May 14, 2011 Overview Some combinatorial optimization problems Randomized versions history
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationMaximum flow problem CE 377K. March 3, 2015
Maximum flow problem CE 377K March 3, 2015 Informal evaluation results 2 slow, 16 OK, 2 fast Most unclear topics: max-flow/min-cut, WHAT WILL BE ON THE MIDTERM? Most helpful things: review at start of
More informationand 6.855J March 6, Maximum Flows 2
5.08 and.855j March, 00 Maximum Flows Network Reliability Communication Network What is the maximum number of arc disjoint paths from s to t? How can we determine this number? Theorem. Let G = (N,A) be
More informationRandomized Algorithms 2017A - Lecture 10 Metric Embeddings into Random Trees
Randomized Algorithms 2017A - Lecture 10 Metric Embeddings into Random Trees Lior Kamma 1 Introduction Embeddings and Distortion An embedding of a metric space (X, d X ) into a metric space (Y, d Y ) is
More informationChapter 16. Greedy Algorithms
Chapter 16. Greedy Algorithms Algorithms for optimization problems (minimization or maximization problems) typically go through a sequence of steps, with a set of choices at each step. A greedy algorithm
More informationTopic: Local Search: Max-Cut, Facility Location Date: 2/13/2007
CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be
More informationFrom Routing to Traffic Engineering
1 From Routing to Traffic Engineering Robert Soulé Advanced Networking Fall 2016 2 In the beginning B Goal: pair-wise connectivity (get packets from A to B) Approach: configure static rules in routers
More informationGraph Theory and Optimization Approximation Algorithms
Graph Theory and Optimization Approximation Algorithms Nicolas Nisse Université Côte d Azur, Inria, CNRS, I3S, France October 2018 Thank you to F. Giroire for some of the slides N. Nisse Graph Theory and
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Ph.D. Thesis Gabriella Divéki Supervisor: Dr. Csanád Imreh University of Szeged
More informationProbabilistic embedding into trees: definitions and applications. Fall 2011 Lecture 4
Probabilistic embedding into trees: definitions and applications. Fall 2011 Lecture 4 Instructor: Mohammad T. Hajiaghayi Scribe: Anshul Sawant September 21, 2011 1 Overview Some problems which are hard
More informationLecture 6: Linear Programming for Sparsest Cut
Lecture 6: Linear Programming for Sparsest Cut Sparsest Cut and SOS The SOS hierarchy captures the algorithms for sparsest cut, but they were discovered directly without thinking about SOS (and this is
More informationDistributed Computing over Communication Networks: Leader Election
Distributed Computing over Communication Networks: Leader Election Motivation Reasons for electing a leader? Reasons for not electing a leader? Motivation Reasons for electing a leader? Once elected, coordination
More informationCS590R - Algorithms for communication networks Lecture 19 Peer-to-Peer Networks (continued)
CS590R - Algorithms for communication networks Lecture 19 Peer-to-Peer Networks (continued) Lecturer: Gopal Pandurangan Scribe: Ossama. ounis Department of Computer Sciences Purdue University 1. Introduction
More informationCSE 521: Design and Analysis of Algorithms I
CSE 521: Design and Analysis of Algorithms I Greedy Algorithms Paul Beame 1 Greedy Algorithms Hard to define exactly but can give general properties Solution is built in small steps Decisions on how to
More informationCOMP Online Algorithms. Online Graph Problems. Shahin Kamali. Lecture 23 - Nov. 28th, 2017 University of Manitoba
COMP 7720 - Online Algorithms Online Graph Problems Shahin Kamali Lecture 23 - Nov. 28th, 2017 University of Manitoba COMP 7720 - Online Algorithms Online Graph Problems 1 / 13 Review & Plan COMP 7720
More informationJade Yu Cheng ICS 311 Homework 7 Sep 18, 2008
Jade Yu Cheng ICS 3 Homework 7 Sep 8, 008 Question for lecture 8 Problem 3-4 on p. 578 Alternative minimum-spanning-tree algorithms In this problem, we give pseudocode for three different algorithms. Each
More informationFixed-Parameter Algorithms, IA166
Fixed-Parameter Algorithms, IA166 Sebastian Ordyniak Faculty of Informatics Masaryk University Brno Spring Semester 2013 Introduction Outline 1 Introduction Algorithms on Locally Bounded Treewidth Layer
More informationLecture 7: Asymmetric K-Center
Advanced Approximation Algorithms (CMU 18-854B, Spring 008) Lecture 7: Asymmetric K-Center February 5, 007 Lecturer: Anupam Gupta Scribe: Jeremiah Blocki In this lecture, we will consider the K-center
More informationCOP 4531 Complexity & Analysis of Data Structures & Algorithms
COP 4531 Complexity & Analysis of Data Structures & Algorithms Lecture 9 Minimum Spanning Trees Thanks to the text authors who contributed to these slides Why Minimum Spanning Trees (MST)? Example 1 A
More informationAlgorithmic Problems Related to Internet Graphs
Algorithmic Problems Related to Internet Graphs Thomas Erlebach Based on joint work with: Zuzana Beerliova, Pino Di Battista, Felix Eberhard, Alexander Hall, Michael Hoffmann, Matúš Mihal ák, Alessandro
More informationOn the Max Coloring Problem
On the Max Coloring Problem Leah Epstein Asaf Levin May 22, 2010 Abstract We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive
More information4.1 Interval Scheduling
41 Interval Scheduling Interval Scheduling Interval scheduling Job j starts at s j and finishes at f j Two jobs compatible if they don't overlap Goal: find maximum subset of mutually compatible jobs a
More informationA synchronizer generates sequences of clock pulses at each node of the network satisfying the condition given by the following definition.
Chapter 8 Synchronizers So far, we have mainly studied synchronous algorithms because generally, asynchronous algorithms are often more di cult to obtain and it is substantially harder to reason about
More informationP and NP (Millenium problem)
CMPS 2200 Fall 2017 P and NP (Millenium problem) Carola Wenk Slides courtesy of Piotr Indyk with additions by Carola Wenk CMPS 2200 Introduction to Algorithms 1 We have seen so far Algorithms for various
More informationDiscrete Mathematics Course Review 3
21-228 Discrete Mathematics Course Review 3 This document contains a list of the important definitions and theorems that have been covered thus far in the course. It is not a complete listing of what has
More informationOnline Computation with Advice
Online Computation with Advice Yuval Emek Pierre Fraigniaud Amos Korman Adi Rosén Abstract We consider a model for online computation in which the online algorithm receives, together with each request,
More informationClustering: Centroid-Based Partitioning
Clustering: Centroid-Based Partitioning Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong 1 / 29 Y Tao Clustering: Centroid-Based Partitioning In this lecture, we
More informationTraveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost
Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R + Goal: find a tour (Hamiltonian cycle) of minimum cost Traveling Salesman Problem (TSP) Input: undirected graph G=(V,E), c: E R
More information/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17
601.433/633 Introduction to Algorithms Lecturer: Michael Dinitz Topic: Sorting lower bound and Linear-time sorting Date: 9/19/17 5.1 Introduction You should all know a few ways of sorting in O(n log n)
More informationWelcome to the course Algorithm Design
Welcome to the course Algorithm Design Summer Term 2011 Friedhelm Meyer auf der Heide Lecture 13, 15.7.2011 Friedhelm Meyer auf der Heide 1 Topics - Divide & conquer - Dynamic programming - Greedy Algorithms
More informationA General Approach to Online Network Optimization Problems
A General Approach to Online Network Optimization Problems NOGA ALON Schools of Mathematics and Computer Science, Tel Aviv University, Tel Aviv, Israel BARUCH AWERBUCH Computer Science Dept., Johns Hopkins
More information15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015
15-451/651: Design & Analysis of Algorithms November 4, 2015 Lecture #18 last changed: November 22, 2015 While we have good algorithms for many optimization problems, the previous lecture showed that many
More informationOnline Algorithms. - Lecture 4 -
Online Algorithms - Lecture 4 - Outline Quick recap.. The Cashing Problem Randomization in Online Algorithms Other views to Online Algorithms The Ski-rental problem The Parking Permit Problem 2 The Caching
More informationLecture 15. Lecturer: Prof. Sergei Fedotov Calculus and Vectors. Length of a Curve and Parametric Equations
Lecture 15 Lecturer: Prof. Sergei Fedotov 10131 - Calculus and Vectors Length of a Curve and Parametric Equations Sergei Fedotov (University of Manchester) MATH10131 2011 1 / 5 Lecture 15 1 Length of a
More informationAdvanced Algorithms. On-line Algorithms
Advanced Algorithms On-line Algorithms 1 Introduction Online Algorithms are algorithms that need to make decisions without full knowledge of the input. They have full knowledge of the past but no (or partial)
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationHigh Dimensional Indexing by Clustering
Yufei Tao ITEE University of Queensland Recall that, our discussion so far has assumed that the dimensionality d is moderately high, such that it can be regarded as a constant. This means that d should
More informationHomework 4 Solutions CSE 101 Summer 2017
Homework 4 Solutions CSE 101 Summer 2017 1 Scheduling 1. LPT Scheduling (a) Find the Upper Bound for makespan of LPT Scheduling for P C max. (b) Find a tight worst-case example for the makespan achieved
More information6.856 Randomized Algorithms
6.856 Randomized Algorithms David Karger Handout #4, September 21, 2002 Homework 1 Solutions Problem 1 MR 1.8. (a) The min-cut algorithm given in class works because at each step it is very unlikely (probability
More informationNetwork Design and Optimization course
Effective maximum flow algorithms Modeling with flows Network Design and Optimization course Lecture 5 Alberto Ceselli alberto.ceselli@unimi.it Dipartimento di Tecnologie dell Informazione Università degli
More informationLecture 5: Duality Theory
Lecture 5: Duality Theory Rajat Mittal IIT Kanpur The objective of this lecture note will be to learn duality theory of linear programming. We are planning to answer following questions. What are hyperplane
More informationAlgorithms design under a geometric lens Spring 2014, CSE, OSU Lecture 1: Introduction
5339 - Algorithms design under a geometric lens Spring 2014, CSE, OSU Lecture 1: Introduction Instructor: Anastasios Sidiropoulos January 8, 2014 Geometry & algorithms Geometry in algorithm design Computational
More informationWe ve done. Introduction to the greedy method Activity selection problem How to prove that a greedy algorithm works Fractional Knapsack Huffman coding
We ve done Introduction to the greedy method Activity selection problem How to prove that a greedy algorithm works Fractional Knapsack Huffman coding Matroid Theory Now Matroids and weighted matroids Generic
More information1 Variations of the Traveling Salesman Problem
Stanford University CS26: Optimization Handout 3 Luca Trevisan January, 20 Lecture 3 In which we prove the equivalence of three versions of the Traveling Salesman Problem, we provide a 2-approximate algorithm,
More informationComp Online Algorithms
Comp 7720 - Online Algorithms Notes 4: Bin Packing Shahin Kamalli University of Manitoba - Fall 208 December, 208 Introduction Bin packing is one of the fundamental problems in theory of computer science.
More information15-854: Approximations Algorithms Lecturer: Anupam Gupta Topic: Direct Rounding of LP Relaxations Date: 10/31/2005 Scribe: Varun Gupta
15-854: Approximations Algorithms Lecturer: Anupam Gupta Topic: Direct Rounding of LP Relaxations Date: 10/31/2005 Scribe: Varun Gupta 15.1 Introduction In the last lecture we saw how to formulate optimization
More informationParallel Breadth First Search
CSE341T/CSE549T 11/03/2014 Lecture 18 Parallel Breadth First Search Today, we will look at a basic graph algorithm, breadth first search (BFS). BFS can be applied to solve a variety of problems including:
More informationProfessor: Padraic Bartlett. Lecture 9: Trees and Art Galleries. Week 10 UCSB 2015
Math 7H Professor: Padraic Bartlett Lecture 9: Trees and Art Galleries Week 10 UCSB 2015 1 Prelude: Graph Theory This talk uses the mathematical concepts of graphs from our previous class. In particular,
More informationOnline Sorting Buffers on Line
Online Sorting Buffers on Line Rohit Khandekar Vinayaka Pandit November 29, 2005 Abstract We consider the online scheduling problem for sorting buffers on a line metric. This problem is motivated by an
More information4. Definition: topological space, open set, topology, trivial topology, discrete topology.
Topology Summary Note to the reader. If a statement is marked with [Not proved in the lecture], then the statement was stated but not proved in the lecture. Of course, you don t need to know the proof.
More informationOblivious Routing on Geometric Networks
Oblivious Routing on Geometric Networks Costas Busch, Malik Magdon-Ismail and Jing Xi {buschc,magdon,xij2}@cs.rpi.edu July 20, 2005. Outline Oblivious Routing: Background and Our Contribution The Algorithm:
More informationMinimum-Spanning-Tree problem. Minimum Spanning Trees (Forests) Minimum-Spanning-Tree problem
Minimum Spanning Trees (Forests) Given an undirected graph G=(V,E) with each edge e having a weight w(e) : Find a subgraph T of G of minimum total weight s.t. every pair of vertices connected in G are
More information16.1 Maximum Flow Definitions
5-499: Parallel Algorithms Lecturer: Guy Blelloch Topic: Graphs IV Date: March 5, 009 Scribe: Bobby Prochnow This lecture describes both sequential and parallel versions of a maximum flow algorithm based
More informationGiven a graph, find an embedding s.t. greedy routing works
Given a graph, find an embedding s.t. greedy routing works Greedy embedding of a graph 99 Greedy embedding Given a graph G, find an embedding of the vertices in R d, s.t. for each pair of nodes s, t, there
More informationLecture 2. 1 Introduction. 2 The Set Cover Problem. COMPSCI 632: Approximation Algorithms August 30, 2017
COMPSCI 632: Approximation Algorithms August 30, 2017 Lecturer: Debmalya Panigrahi Lecture 2 Scribe: Nat Kell 1 Introduction In this lecture, we examine a variety of problems for which we give greedy approximation
More informationCS 395T Computational Learning Theory. Scribe: Wei Tang
CS 395T Computational Learning Theory Lecture 1: September 5th, 2007 Lecturer: Adam Klivans Scribe: Wei Tang 1.1 Introduction Many tasks from real application domain can be described as a process of learning.
More informationBandwidth Approximation of Many-Caterpillars
Bandwidth Approximation of Many-Caterpillars Yuval Filmus September 1, 2009 Abstract Bandwidth is one of the canonical NPcomplete problems. It is NP-hard to approximate within any constant factor even
More informationBasic Approximation algorithms
Approximation slides Basic Approximation algorithms Guy Kortsarz Approximation slides 2 A ρ approximation algorithm for problems that we can not solve exactly Given an NP-hard question finding the optimum
More informationCSE 202: Design and Analysis of Algorithms Lecture 4
CSE 202: Design and Analysis of Algorithms Lecture 4 Instructor: Kamalika Chaudhuri Announcements HW 1 due in class on Tue Jan 24 Email me your homework partner name, or if you need a partner today Greedy
More informationLecture 15: The subspace topology, Closed sets
Lecture 15: The subspace topology, Closed sets 1 The Subspace Topology Definition 1.1. Let (X, T) be a topological space with topology T. subset of X, the collection If Y is a T Y = {Y U U T} is a topology
More informationName: Lirong TAN 1. (15 pts) (a) Define what is a shortest s-t path in a weighted, connected graph G.
1. (15 pts) (a) Define what is a shortest s-t path in a weighted, connected graph G. A shortest s-t path is a path from vertex to vertex, whose sum of edge weights is minimized. (b) Give the pseudocode
More informationReordering Buffer Management with Advice
Reordering Buffer Management with Advice Anna Adamaszek Marc P. Renault Adi Rosén Rob van Stee Abstract In the reordering buffer management problem, a sequence of coloured items arrives at a service station
More informationDepartment of Mathematics and Computer Science University of Southern Denmark, Odense. Exercises for Week 47 on. Online Algorithms
Department of Mathematics and Computer Science University of Southern Denmark, Odense November 7, 06 KSL Exercises for Week 7 on Online Algorithms a topic in DM5 Introduction to Computer Science Kim Skak
More informationIntroduction to Algorithms / Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14
600.363 Introduction to Algorithms / 600.463 Algorithms I Lecturer: Michael Dinitz Topic: Approximation algorithms Date: 11/18/14 23.1 Introduction We spent last week proving that for certain problems,
More informationGeometric Routing: Of Theory and Practice
Geometric Routing: Of Theory and Practice PODC 03 F. Kuhn, R. Wattenhofer, Y. Zhang, A. Zollinger [KWZ 02] [KWZ 03] [KK 00] Asymptotically Optimal Geometric Mobile Ad-Hoc Routing Worst-Case Optimal and
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 24: Online Algorithms
princeton univ. F 17 cos 521: Advanced Algorithm Design Lecture 24: Online Algorithms Lecturer: Matt Weinberg Scribe:Matt Weinberg Lecture notes sourced from Avrim Blum s lecture notes here: http://www.cs.cmu.edu/
More informationAlgorithms for Euclidean TSP
This week, paper [2] by Arora. See the slides for figures. See also http://www.cs.princeton.edu/~arora/pubs/arorageo.ps Algorithms for Introduction This lecture is about the polynomial time approximation
More informationPage migration in dynamic networks
Page migration in dynamic networks Friedhelm Meyer auf der Heide Data management in networks Friedhelm Meyer auf der Heide How to store data items in a network, so that arbitrary sequences of accesses
More informationDesign and Analysis of Algorithms
CSE 101, Winter 018 D/Q Greed SP s DP LP, Flow B&B, Backtrack Metaheuristics P, NP Design and Analysis of Algorithms Lecture 8: Greed Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Optimization
More informationPolynomial-Time Approximation Algorithms
6.854 Advanced Algorithms Lecture 20: 10/27/2006 Lecturer: David Karger Scribes: Matt Doherty, John Nham, Sergiy Sidenko, David Schultz Polynomial-Time Approximation Algorithms NP-hard problems are a vast
More informationChapter Design Techniques for Approximation Algorithms
Chapter 2 Design Techniques for Approximation Algorithms I N THE preceding chapter we observed that many relevant optimization problems are NP-hard, and that it is unlikely that we will ever be able to
More informationDistributed Algorithms 6.046J, Spring, Nancy Lynch
Distributed Algorithms 6.046J, Spring, 205 Nancy Lynch What are Distributed Algorithms? Algorithms that run on networked processors, or on multiprocessors that share memory. They solve many kinds of problems:
More informationChapter 6 DOMINATING SETS
Chapter 6 DOMINATING SETS Distributed Computing Group Mobile Computing Summer 2003 Overview Motivation Dominating Set Connected Dominating Set The Greedy Algorithm The Tree Growing Algorithm The Marking
More informationLecture 07: Private-key Encryption. Private-key Encryption
Lecture 07: Three algorithms Key Generation: Generate the secret key sk Encryption: Given the secret key sk and a message m, it outputs the cipher-text c (Note that the encryption algorithm can be a randomized
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationBatch Coloring of Graphs
Batch Coloring of Graphs Joan Boyar 1, Leah Epstein 2, Lene M. Favrholdt 1, Kim S. Larsen 1, and Asaf Levin 3 1 Dept. of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark,
More informationOnline Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010
Online Stochastic Matching CMSC 858F: Algorithmic Game Theory Fall 2010 Barna Saha, Vahid Liaghat Abstract This summary is mostly based on the work of Saberi et al. [1] on online stochastic matching problem
More informationLecture Notes: Euclidean Traveling Salesman Problem
IOE 691: Approximation Algorithms Date: 2/6/2017, 2/8/2017 ecture Notes: Euclidean Traveling Salesman Problem Instructor: Viswanath Nagarajan Scribe: Miao Yu 1 Introduction In the Euclidean Traveling Salesman
More informationDesign and Analysis of Algorithms
Design and Analysis of Algorithms CS 5311 Lecture 19 Topological Sort Junzhou Huang, Ph.D. Department of Computer Science and ngineering CS5311 Design and Analysis of Algorithms 1 Topological Sort Want
More informationCS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I. Instructor: Shaddin Dughmi
CS599: Convex and Combinatorial Optimization Fall 2013 Lecture 14: Combinatorial Problems as Linear Programs I Instructor: Shaddin Dughmi Announcements Posted solutions to HW1 Today: Combinatorial problems
More informationLecture 19 Subgradient Methods. November 5, 2008
Subgradient Methods November 5, 2008 Outline Lecture 19 Subgradients and Level Sets Subgradient Method Convergence and Convergence Rate Convex Optimization 1 Subgradients and Level Sets A vector s is a
More informationAn Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. Qassem Abu Ahmad February 10, 2008
An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks Qassem Abu Ahmad February 10, 2008 i Contents 1 Introduction 1 2 Main Results 2 3 An Optimal bound
More information