Welcome to the course Algorithm Design
|
|
- Nathaniel Logan
- 6 years ago
- Views:
Transcription
1 Welcome to the course Algorithm Design Summer Term 2011 Friedhelm Meyer auf der Heide Lecture 12, Friedhelm Meyer auf der Heide 1
2 Randomised Algorithms Friedhelm Meyer auf der Heide 2
3 Topics - Divide & conquer - Dynamic programming - Greedy Algorithms - Randomized Algorithms - Approximation Algorithms - Online Algorithms Friedhelm Meyer auf der Heide 3
4 Online Algorithms An online algorithm is one that can process its input piece-by-piece, without having the entire input available from the start. In contrast, an offline algorithm is given the whole problem data from the beginning and is required to output an answer which solves the problem at hand. Input: a sequence of requests. Task: process the requests as efficiently as possible Online: i th request has to be processed before future requests are known Offline: All requests are known in advance Friedhelm Meyer auf der Heide 4
5 How to measure quality of online algorithms? 1. Assume some a priori knowledge about request sequence, e.g., requests are chosen randomly 2. Assume worst case measure, compare online cost to offline cost Online : standard competitive analysis competitive ratio Online randomized: Friedhelm Meyer auf der Heide 5
6 Paging Friedhelm Meyer auf der Heide 6
7 Paging: A basic problem for an operating system Paging: given a main memory that can hold k pages. Main memory Size k=6 Input: request sequence of pages to be used by the processor Goal: Need as few page faults ( requests for pages that have to be moved from disk to main memory) The algorithm has to store the requested page in main memory in case of a page fault, and has to choose a page to be removed from main memory. Disk Friedhelm Meyer auf der Heide 7
8 Paging Optimal offline: Friedhelm Meyer auf der Heide 8
9 Paging Two online strategies: Theorem: LRU and FIFO are k-competitive. This competitive ratio is best possible. Friedhelm Meyer auf der Heide 9
10 Paging In practise, both algorithms are much better, the observed competitive ratio decreases with increasing memory size k. Furthermore, LRU turns out to be better than FIFO. Reasons: In practise, request sequences exhibit locality, i.e., they tend to use the same pages more often, and have dependencies among pages. ( If page A is accessed, then it is likely that page B will be accessed shortly afterwards ) Way out: Model restrictions to the adversary, i.e. the bad guy that generates the worst case sequences. This is done using access graphs. Friedhelm Meyer auf der Heide 10
11 Page Migration Friedhelm Meyer auf der Heide 11
12 Page Migration Model (1) Page migration Classical online problem processors connected by a network v 3 v 2 v 4 v 5 v 1 v 6 v 7 There are costs of communication associated with each edge. Cost of communication between pair of nodes = cost of the cheapest path between these nodes. Costs of communication fulfill the triangle inequality. Friedhelm Meyer auf der Heide 12
13 Page Migration Model (2) Alternative view: processors in a metric space v 3 v 2 v 4 v 5 v 1 v 6 v 7 Indivisible memory page of size one processor (initially at ) in the local memory of Friedhelm Meyer auf der Heide 13
14 Page Migration Model (3) Input: sequence of processors, dictated by a request adversary - processor which wants to access (read or write) one unit of data from the memory page. v 3 v 2 v 4 v 5 v 1 v 7 v 6 After serving a request an algorithm may move the page to a new processor. Friedhelm Meyer auf der Heide 14
15 Page Migration (cost model) Cost model: The page is at node. Serving a request issued at costs. Moving the page to node costs. Friedhelm Meyer auf der Heide 15
16 A randomized algorithm Memoryless coin-flipping algorithm CF [Westbrook 92] In each step, after serving a request issued at, move page to with probability. Theorem: CF is 3-competitive against an adaptive-online adversary (may see the outcomes of the coinflips). Remark: This ratio is optimal against adaptive-online adversary. Friedhelm Meyer auf der Heide 16
17 Proof of competitiveness of CF We run CF and OPT in parallel on the input sequence We define potential function There are two events to consider in each step Request occurs at a node, CF and OPT serve the requests, part 1 CF optionally moves the page OPT optionally moves the page } part 2 For each part separately, we prove that Friedhelm Meyer auf der Heide 17
18 Proof of competitiveness of CF Note: This is a telescopic sum. Thus the cancel out and we get the competitive ratio 3. Friedhelm Meyer auf der Heide 18
19 Competitiveness of CF, a step Page in and resp. Request occurs at CF and OPT serve the requests CF optionally moves the page to part 1 OPT optionally moves the page part 2 to Friedhelm Meyer auf der Heide 19
20 Competitiveness of CF part 1 Request occurs at Cost of serving requests: in CF : a, in OPT : b Expected cost of moving the page: Potential before: Exp. potential after: Exp. change of the potential: Friedhelm Meyer auf der Heide 20
21 Competitiveness of CF part 2 OPT moves to Friedhelm Meyer auf der Heide 21
22 Deterministic algorithm Algorithm Move-To-Min (MTM) [Awerbuch, Bartal, Fiat 93] After each steps, choose to be the node which minimizes, and move to. ( is the best place for the page in the last steps) Theorem: MTM is 7-competitive Remark: The currently best deterministic algorithm achieves competitive ratio of Friedhelm Meyer auf der Heide 22
23 Results on page migration The best known bounds: Deterministic Randomized: Oblivious adversary Algorithm [Bartal, Charikar, Indyk 96] [Westbrook 91] Lower bound [Chrobak, Larmore, Reingold, Westbrook 94] [Chrobak, Larmore, Reingold, Westbrook 94] Randomized: Adaptive-online adversary [Westbrook 91] [Westbrook 91] Friedhelm Meyer auf der Heide 23
24 Data management in networks Friedhelm Meyer auf der Heide 24
25 Scenario Networks have low bandwidth, global objects are small, access is fine grained. typical for parallel processor networks, partially also for the internet. bottleneck: link-congestion task: distribute global objects (maybe dynamically) among processors such that an application (sequence of read/write access to global variables) can be executed using small link-congestion storage overhead is small. - Exploit Locality - Friedhelm Meyer auf der Heide 25
26 Basic Strategy Design strategy for trees Produce strategy for target-network by tree embedding Friedhelm Meyer auf der Heide 26
27 Dynamic Model Application: Sequence of read / write requests from processors to objects. Each processor decides solely based on its local knowledge. distributed online-strategy Goal: Develop strategy that produces only by a factor c more congestion than an optimal offline strategy. c-competitive strategy (and by a factor m more storage per processor (m, c) competitive strategy ) Friedhelm Meyer auf der Heide 27
28 Dynamic strategy for trees v writes to x : v creates (or updates) copy of x in v, and invalidates all other copies (consistency!) v reads x: v reads the closest copy of x and creates copies in every processor on the path back to v. (Remark: Data Tracking in trees is easy!) Friedhelm Meyer auf der Heide 28
29 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 0 Friedhelm Meyer auf der Heide 29
30 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v 0 Friedhelm Meyer auf der Heide 30
31 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v 0 Friedhelm Meyer auf der Heide 31
32 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v 0 v 2 Friedhelm Meyer auf der Heide 32
33 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v 0 v 2 Friedhelm Meyer auf der Heide 33
34 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v 0 v 2 v 3 Friedhelm Meyer auf der Heide 34
35 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v k v 0 v 2 v 3 Friedhelm Meyer auf der Heide 35
36 Example and Analysis Consider phase write (v 0 ), read (v 1 ), read (v 2 ),..., read (v k-1 ), write (v k ) v 1 v k v 0 v 2 3 Each strategy has to use each link of the red subtree at least once. Our strategy uses each of these links at most three times. Strategy is 3-competitive for trees v Friedhelm Meyer auf der Heide 36
37 Thank you for your attention! Friedhelm Meyer auf der Heide Heinz Nixdorf Institute & Computer Science Department Fürstenallee Paderborn, Germany Tel.: +49 (0) 52 51/ Fax: +49 (0) 52 51/ Friedhelm Meyer auf der Heide 37
Welcome 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 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 information9 Distributed Data Management II Caching
9 Distributed Data Management II Caching In this section we will study the approach of using caching for the management of data in distributed systems. Caching always tries to keep data at the place where
More information7 Distributed Data Management II Caching
7 Distributed Data Management II Caching In this section we will study the approach of using caching for the management of data in distributed systems. Caching always tries to keep data at the place where
More informationPhase-based algorithms for file migration
Phase-based algorithms for file migration Marcin Bieńkowski Jarek Byrka Marcin Mucha University of Wrocław University of Warsaw HALG 2018 (previously on ICALP 2017) File migration Weighted graph "2 File
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 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 informationMore on weighted servers
More on weighted servers or FIFO is better than LRU Leah Epstein Csanád Imreh Rob van Stee Abstract We consider a generalized 2-server problem on the uniform space in which servers have different costs
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 informationParallel Computing in Paderborn: The SFB 376 Massive Parallelism Algorithms, Design Methods, Applications?
Parallel Computing in Paderborn: The SFB 376 Massive Parallelism Algorithms, Design Methods, Applications? Friedhelm Meyer auf der Heide, Thomas Decker Department of Mathematics and Computer Science and
More informationFast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots Tamás Lukovszki and Friedhelm Meyer auf der Heide Eötvös Loránd University, Budapest, Hungary University of Paderborn, Germany lukovszki@inf.elte.hu
More informationCompetitive Algorithms for Distributed Data. Department of Computer Science. School of Mathematics. Tel-Aviv University. Tel-Aviv 69978, Israel.
Competitive Algorithms for Distributed Data Management Yair Bartal Amos Fiat Yuval Rabani Department of Computer Science School of Mathematics Tel-Aviv University Tel-Aviv 69978, Israel. Abstract We deal
More informationData Management in Networks: Experimental Evaluation of a Provably Good Strategy
Data Management in Networks: Experimental Evaluation of a Provably Good Strategy Christof Krick Friedhelm Meyer auf der Heide Harald Räcke Berthold Vöcking Matthias Westermann Abstract This paper deals
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 informationCompetitive analysis of aggregate max in windowed streaming. July 9, 2009
Competitive analysis of aggregate max in windowed streaming Elias Koutsoupias University of Athens Luca Becchetti University of Rome July 9, 2009 The streaming model Streaming A stream is a sequence of
More informationA Primal-Dual Approach for Online Problems. Nikhil Bansal
A Primal-Dual Approach for Online Problems Nikhil Bansal Online Algorithms Input revealed in parts. Algorithm has no knowledge of future. Scheduling, Load Balancing, Routing, Caching, Finance, Machine
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 informationAlgorithm 23 works. Instead of a spanning tree, one can use routing.
Chapter 5 Shared Objects 5.1 Introduction Assume that there is a common resource (e.g. a common variable or data structure), which different nodes in a network need to access from time to time. If the
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 informationLecture 8 Sept 25, 2014
CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 8 Sept 25, 2014 Scribe: Jean Pouget-Abadie 1 Online Algorithms - Overview In this lecture, we are going to cover Online algorithms which
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 informationPaging with connections: FIFO strikes again
Paging with connections: FIFO strikes again Leah Epstein a Yanir Kleiman b Jiří Sgall c,1 Rob van Stee d,2 a Department of Mathematics, University of Haifa, 31905 Haifa, Israel. b The Academic College
More informationCompetitive distributed file allocation
Information and Computation 185 (2003) 1 40 www.elsevier.com/locate/ic Competitive distributed file allocation Baruch Awerbuch, a,1 Yair Bartal, b,2 and Amos Fiat c,,3 a Laboratory for Computer Science,
More informationOnline Facility Location
Online Facility Location Adam Meyerson Abstract We consider the online variant of facility location, in which demand points arrive one at a time and we must maintain a set of facilities to service these
More informationFrom Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
SIAM Journal on Computing to appear From Static to Dynamic Routing: Efficient Transformations of StoreandForward Protocols Christian Scheideler Berthold Vöcking Abstract We investigate how static storeandforward
More informationOnline Algorithms. Lecture 11
Online Algorithms Lecture 11 Today DC on trees DC on arbitrary metrics DC on circle Scheduling K-server on trees Theorem The DC Algorithm is k-competitive for the k server problem on arbitrary tree metrics.
More informationCourse Outline. Processes CPU Scheduling Synchronization & Deadlock Memory Management File Systems & I/O Distributed Systems
Course Outline Processes CPU Scheduling Synchronization & Deadlock Memory Management File Systems & I/O Distributed Systems 1 Today: Memory Management Terminology Uniprogramming Multiprogramming Contiguous
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 informationOnline Coloring Known Graphs
Online Coloring Known Graphs Magnús M. Halldórsson Science Institute University of Iceland IS-107 Reykjavik, Iceland mmh@hi.is, www.hi.is/ mmh. Submitted: September 13, 1999; Accepted: February 24, 2000.
More informationCALIFORNIA STATE UNIVERSITY, NORTHRIDGE
CALIFORNIA STATE UNIVERSITY, NORTHRIDGE COMPETITIVE ANALYSIS OF ONLINE DISTRIBUTED PAGING ALGORITHMS A thesis submitted in partial fulfillment of the requirements For the degree of Master of Science in
More informationCOMP 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 informationCompetitive Distributed File Allocation. Abstract. This paper deals with the le allocation problem [BFR92] concerning the dynamic optimization
Competitive Distributed File Allocation Baruch Awerbuch Yair Bartal y Amos Fiat z Abstract This paper deals with the le allocation problem [BFR92] concerning the dynamic optimization of communication costs
More informationLecture 1: An Introduction to Online Algorithms
Algoritmos e Incerteza (PUC-Rio INF979, 017.1) Lecture 1: An Introduction to Online Algorithms Mar 1, 017 Lecturer: Marco Molinaro Scribe: Joao Pedro T. Brandao Online algorithms differ from traditional
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 informationNon-Preemptive Buffer Management for Latency Sensitive Packets
Non-Preemptive Buffer Management for Latency Sensitive Packets Moran Feldman Technion Haifa, Israel Email: moranfe@cs.technion.ac.il Joseph (Seffi) Naor Technion Haifa, Israel Email: naor@cs.technion.ac.il
More informationMidpoint Routing algorithms for Delaunay Triangulations
Midpoint Routing algorithms for Delaunay Triangulations Weisheng Si and Albert Y. Zomaya Centre for Distributed and High Performance Computing School of Information Technologies Prologue The practical
More informationA Combined BIT and TIMESTAMP Algorithm for. the List Update Problem. Susanne Albers, Bernhard von Stengel, Ralph Werchner
A Combined BIT and TIMESTAMP Algorithm for the List Update Problem Susanne Albers, Bernhard von Stengel, Ralph Werchner International Computer Science Institute, 1947 Center Street, Berkeley, CA 94704,
More informationOnline Algorithms. Lecture Notes for CSCI 570 by David Kempe December 1, 2006
Online Algorithms Lecture Notes for CSCI 570 by David Kempe December 1, 2006 So far in class, we have only considered the traditional framework for algorithm design, as follows: we are given an input I,
More informationCalculating lower bounds for caching problems
Calculating lower bounds for caching problems Leah Epstein Rob van Stee Abstract We present a general method for computing lower bounds for various caching problems. We apply the method to two well known
More informationA Guide to Deterministic and Randomized Online Algorithms for the List Access Problem
MT F, BIT, and COMB: A Guide to Deterministic and Randomized Online Algorithms for the List Access Problem Kevin Andrew kandrew@cs.hmc.edu David Gleich dgleich@cs.hmc.edu April 30, 2004 Abstract In this
More informationThe Online Connected Facility Location Problem
The Online Connected Facility Location Problem Mário César San Felice 1, David P. Willamson 2, and Orlando Lee 1 1 Unicamp, Institute of Computing, Campinas SP 13083-852, Brazil felice@ic.unicamp.br, lee@ic.unicamp.br
More informationPrimality Testing. Public-Key Cryptography needs large prime numbers How can you tell if p is prime? Try dividing p by all smaller integers
Primality Testing Public-Key Cryptography needs large prime numbers How can you tell if p is prime? Try dividing p by all smaller integers Exponential in p (number of bits to represent p) Improvement:
More informationRandomized algorithms have several advantages over deterministic ones. We discuss them here:
CS787: Advanced Algorithms Lecture 6: Randomized Algorithms In this lecture we introduce randomized algorithms. We will begin by motivating the use of randomized algorithms through a few examples. Then
More informationThe hierarchical model for load balancing on two machines
The hierarchical model for load balancing on two machines Orion Chassid Leah Epstein Abstract Following previous work, we consider the hierarchical load balancing model on two machines of possibly different
More informationVertex Cover Approximations
CS124 Lecture 20 Heuristics can be useful in practice, but sometimes we would like to have guarantees. Approximation algorithms give guarantees. It is worth keeping in mind that sometimes approximation
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Summary of the Ph.D. thesis by Gabriella Divéki Supervisor Dr. Csanád Imreh
More informationFrom Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols Christian Scheideler Ý Berthold Vöcking Þ Abstract We investigate how static store-and-forward routing algorithms
More informationA Randomized Algorithm for Two Servers in Cross Polytope S
A Randomied Algorithm for Two Servers in Cross Polytope Spaces Center for the Advanced Study of Algorithms School of Computer Science University of Nevada, Las Vegas WAOA 2007 coauthors: Kauo Iwama, Jun
More informationarxiv: v2 [cs.ds] 6 Jun 2007
A randomized algorithm for the on-line weighted bipartite matching problem arxiv:0705.4673v2 [cs.ds] 6 Jun 2007 Béla Csaba András Pluhár Abstract We study the on-line minimum weighted bipartite matching
More informationDoes Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger
Does Topology Control Reduce Interference? Martin Burkhart Pascal von Rickenbach Roger Wattenhofer Aaron Zollinger Overview What is Topology Control? Context related work Explicit interference model Interference
More informationNetwork Coding. Chapter 5. Ad Hoc and Sensor Networks. Roger Wattenhofer 5/1
Network Coding Chapter 5 Roger Wattenhofer 5/1 Agriculture (precision farming) Farming decision support system based on recent local environmental data High accuracy: GPS tractors Irrigation, fertilization,
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 informationLecture Overview. 2 Online Algorithms. 2.1 Ski rental problem (rent-or-buy) COMPSCI 532: Design and Analysis of Algorithms November 4, 2015
COMPSCI 532: Design and Analysis of Algorithms November 4, 215 Lecturer: Debmalya Panigrahi Lecture 19 Scribe: Allen Xiao 1 Overview In this lecture, we motivate online algorithms and introduce some of
More informationGeo-Routing. Chapter 2. Ad Hoc and Sensor Networks Roger Wattenhofer
Geo-Routing Chapter 2 Ad Hoc and Sensor Networks Roger Wattenhofer 2/1 Application of the Week: Mesh Networking (Roofnet) Sharing Internet access Cheaper for everybody Several gateways fault-tolerance
More informationOutline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility
Outline CS38 Introduction to Algorithms Lecture 18 May 29, 2014 coping with intractibility approximation algorithms set cover TSP center selection randomness in algorithms May 29, 2014 CS38 Lecture 18
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 informationRouting with Bounded Buers and. in Vertex-Symmetric Networks? Friedhelm Meyer auf der Heide and Christian Scheideler. University of Paderborn
Routing with Bounded Buers and Hot-Potato Routing in Vertex-Symmetric Networks? Friedhelm Meyer auf der Heide and Christian Scheideler Department of Mathematics and Computer Science and Heinz Nixdorf Institute
More information13 Sensor networks Gathering in an adversarial environment
13 Sensor networks Wireless sensor systems have a broad range of civil and military applications such as controlling inventory in a warehouse or office complex, monitoring and disseminating traffic conditions,
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 informationDesigning Networks Incrementally
Designing Networks Incrementally Adam Meyerson Kamesh Munagala Ý Serge Plotkin Þ Abstract We consider the problem of incrementally designing a network to route demand to a single sink on an underlying
More informationPAGE REPLACEMENT. Operating Systems 2015 Spring by Euiseong Seo
PAGE REPLACEMENT Operating Systems 2015 Spring by Euiseong Seo Today s Topics What if the physical memory becomes full? Page replacement algorithms How to manage memory among competing processes? Advanced
More informationOnline Algorithms with Advice
Online Algorithms with Advice Marc Renault Supervisor: Adi Rosén, Algorithms and Complexity LRI August 21, 2010 This report is written in English as the maternal language of Marc Renault is English and
More informationPick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets
Pick, Pack, & Survive: Charging Robots in a Modern Warehouse based on Online Connected Dominating Sets Heiko Hamann Institute of Computer Engineering, University of Lübeck, Germany https://www.iti.uni-luebeck.de
More informationAlgorithms and Data Structures for Mathematicians
Algorithms and Data Structures for Mathematicians Lecture 5: Sorting Peter Kostolányi kostolanyi at fmph and so on Room M-258 26 October 2017 Sorting Algorithms Covered So Far Worst-case time complexity
More informationA survey on relay placement with runtime and approximation guarantees
C O M P U T E R S C I E N C E R E V I E W 5 ( 2 0 1 1 ) 5 7 6 8 available at www.sciencedirect.com journal homepage: www.elsevier.com/locate/cosrev Survey A survey on relay placement with runtime and approximation
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 informationSustainable Computing: Informatics and Systems 00 (2014) Huangxin Wang
Sustainable Computing: Informatics and Systems 00 (2014) 1 17 Sustainable Computing Worst-Case Performance Guarantees of Scheduling Algorithms Maximizing Weighted Throughput in Energy-Harvesting Networks
More informationOnline Scheduling for Sorting Buffers
Online Scheduling for Sorting Buffers Harald Räcke ½, Christian Sohler ½, and Matthias Westermann ¾ ½ Heinz Nixdorf Institute and Department of Mathematics and Computer Science Paderborn University, D-33102
More informationMinimizing Congestion in General Networks
Minimizing Congestion in General Networks Harald Räcke Heinz Nixdorf Institute and Department of Mathematics and Computer Science Paderborn University, Germany harry@upb.de Abstract A principle task in
More informationLecture 11: Maximum flow and minimum cut
Optimisation Part IB - Easter 2018 Lecture 11: Maximum flow and minimum cut Lecturer: Quentin Berthet 4.4. The maximum flow problem. We consider in this lecture a particular kind of flow problem, with
More informationAlgorithmen II. Peter Sanders, Christian Schulz, Simon Gog. Übungen: Michael Axtmann. Institut für Theoretische Informatik, Algorithmik II.
Schulz, Gog, Sanders: Algorithmen II - 31. Januar 2017 Algorithmen II Peter Sanders, Christian Schulz, Simon Gog Übungen: Michael Axtmann Institut für Theoretische Informatik, Algorithmik II Web: http://algo2.iti.kit.edu/algorithmenii_ws16.php
More informationLecture 9: (Semi-)bandits and experts with linear costs (part I)
CMSC 858G: Bandits, Experts and Games 11/03/16 Lecture 9: (Semi-)bandits and experts with linear costs (part I) Instructor: Alex Slivkins Scribed by: Amr Sharaf In this lecture, we will study bandit problems
More informationAlg o ri t hmica Springer-Verlsg New York Inc.
Algorithmica (1994) 11: 15-32 Alg o ri t hmica 0 1994 Springer-Verlsg New York Inc. Randomized Competitive Algorithms for the List Update Problem Nick Reingold, Jeffery We~tbrook,~ and Daniel D. Sleator4
More informationBasic Memory Management. Basic Memory Management. Address Binding. Running a user program. Operating Systems 10/14/2018 CSC 256/456 1
Basic Memory Management Program must be brought into memory and placed within a process for it to be run Basic Memory Management CS 256/456 Dept. of Computer Science, University of Rochester Mono-programming
More information1 Overview. 2 Applications of submodular maximization. AM 221: Advanced Optimization Spring 2016
AM : Advanced Optimization Spring 06 Prof. Yaron Singer Lecture 0 April th Overview Last time we saw the problem of Combinatorial Auctions and framed it as a submodular maximization problem under a partition
More informationIndependent Sets in Hypergraphs with. Applications to Routing Via Fixed Paths. y.
Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths Noga Alon 1, Uri Arad 2, and Yossi Azar 3 1 Department of Mathematics and Computer Science, Tel-Aviv University noga@mathtauacil
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 information3.6.2 Generating admissible heuristics from relaxed problems
3.6.2 Generating admissible heuristics from relaxed problems To come up with heuristic functions one can study relaxed problems from which some restrictions of the original problem have been removed The
More informationOblivious Routing on Node-Capacitated and Directed Graphs
Oblivious Routing on Node-Capacitated and Directed Graphs Mohammad Thagi Hajiaghayi Robert D. Kleinberg Tom Leighton Harald Räcke Abstract Oblivious routing algorithms for general undirected networks were
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 informationOnline Scheduling for Sorting Buffers
Online Scheduling for Sorting Buffers Harald Räcke 1, Christian Sohler 1, and Matthias Westermann 2 1 Heinz Nixdorf Institute and Department of Mathematics and Computer Science Paderborn University, D-33102
More informationMaster of Science in Advanced Mathematics and Mathematical Engineering
Master of Science in Advanced Mathematics and Mathematical Engineering Title: Online Coloring Problem with a Randomized Adversary and Infinite Advice. Author: Elisabet Burjons Advisor: Xavier Muñoz Department:
More informationComp Online Algorithms
Comp 7720 - Online Algorithms Assignment 2: Compression, Splay Trees, Caching, and k-server Shahin Kamalli University of Manitoba - Fall 2018 Due: Monday, October 22th at 11:59 pm October 27, 2018 [Computer
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 informationOnline file caching with rejection penalties
Online file caching with rejection penalties Leah Epstein Csanád Imreh Asaf Levin Judit Nagy-György Abstract In the file caching problem, the input is a sequence of requests for files out of a slow memory.
More informationGreedy algorithms Or Do the right thing
Greedy algorithms Or Do the right thing March 1, 2005 1 Greedy Algorithm Basic idea: When solving a problem do locally the right thing. Problem: Usually does not work. VertexCover (Optimization Version)
More informationCS261: A Second Course in Algorithms Lecture #14: Online Bipartite Matching
CS61: A Second Course in Algorithms Lecture #14: Online Bipartite Matching Tim Roughgarden February 18, 16 1 Online Bipartite Matching Our final lecture on online algorithms concerns the online bipartite
More informationICS 691: Advanced Data Structures Spring Lecture 3
ICS 691: Advanced Data Structures Spring 2016 Prof. Nodari Sitchinava Lecture 3 Scribe: Ben Karsin 1 Overview In the last lecture we started looking at self-adjusting data structures, specifically, move-to-front
More informationOn the online unit clustering problem
On the online unit clustering problem Leah Epstein Rob van Stee June 17, 2008 Abstract We continue the study of the online unit clustering problem, introduced by Chan and Zarrabi-Zadeh (Workshop on Approximation
More informationComparison Based Sorting Algorithms. Algorithms and Data Structures: Lower Bounds for Sorting. Comparison Based Sorting Algorithms
Comparison Based Sorting Algorithms Algorithms and Data Structures: Lower Bounds for Sorting Definition 1 A sorting algorithm is comparison based if comparisons A[i] < A[j], A[i] A[j], A[i] = A[j], A[i]
More informationOnline Sorting Buffers on Line
Online Sorting Buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada rkhandekar@gmail.com 2 IBM India Research Laboratory, New Delhi, India pvinayak@in.ibm.com Abstract.
More informationOnline Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks or/and: How to migrate / allocate resources when you don t know the future? Co-authors: Dushyant Arora Marcin Bienkowski
More informationApproximation Algorithms
Approximation Algorithms Given an NP-hard problem, what should be done? Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one of three desired features. Solve problem to optimality.
More information11.1 Facility Location
CS787: Advanced Algorithms Scribe: Amanda Burton, Leah Kluegel Lecturer: Shuchi Chawla Topic: Facility Location ctd., Linear Programming Date: October 8, 2007 Today we conclude the discussion of local
More informationOnline Bipartite Matching: A Survey and A New Problem
Online Bipartite Matching: A Survey and A New Problem Xixuan Feng xfeng@cs.wisc.edu Abstract We study the problem of online bipartite matching, where algorithms have to draw irrevocable matchings based
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 informationApproximation Algorithms
Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Approximation Algorithms Tamassia Approximation Algorithms 1 Applications One of
More informationRandomized Algorithms for Online Matching with Two Sources
Distributed Computing Randomized Algorithms for Online Matching with Two Sources Bachelor Thesis Thai Duong Nguyen nguyetha@student.ethz.ch Distributed Computing Group Computer Engineering and Networks
More informationLecture 9 & 10: Local Search Algorithm for k-median Problem (contd.), k-means Problem. 5.1 Local Search Algorithm for k-median Problem
Algorithmic Excursions: Topics in Computer Science II Spring 2016 Lecture 9 & 10: Local Search Algorithm for k-median Problem (contd.), k-means Problem Lecturer: Kasturi Varadarajan Scribe: Tanmay Inamdar
More informationDynamic Routing on Networks with Fixed-Size Buffers
1 Dynamic Routing on Networks with Fixed-Size Buffers William Aiello Eyal Kushilevitz Rafail Ostrovsky Adi Rosén AT&T Labs Technion Telcordia Tech. Technion 2 Simple Packet Network Model directed graph
More information