A General Approach to Online Network Optimization Problems Seffi Naor Computer Science Dept. Technion Haifa, Israel Joint work: Noga Alon, Yossi Azar,

Slides:



Advertisements
Similar presentations
Iterative Rounding and Iterative Relaxation
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Approximation Algorithms for Capacitated Set Cover Ravishankar Krishnaswamy (joint work with Nikhil Bansal and Barna Saha)
Multicut Lower Bounds via Network Coding Anna Blasiak Cornell University.
All-or-Nothing Multicommodity Flow Chandra Chekuri Sanjeev Khanna Bruce Shepherd Bell Labs U. Penn Bell Labs.
Approximation Algorithms Chapter 5: k-center. Overview n Main issue: Parametric pruning –Technique for approximation algorithms n 2-approx. algorithm.
Approximation Some Network Design Problems With Node Costs Guy Kortsarz Rutgers University, Camden, NJ Joint work with Zeev Nutov The Open University,
1 Online and Stochastic Survivable Network Design Ravishankar Krishnaswamy Carnegie Mellon University joint work with Anupam Gupta and R. Ravi.
Approximation Algoirthms: Semidefinite Programming Lecture 19: Mar 22.
Algorithms for Max-min Optimization
1 Approximation Algorithms for Demand- Robust and Stochastic Min-Cut Problems Vineet Goyal Carnegie Mellon University Based on, [Golovin, G, Ravi] (STACS’06)
A Constant Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar Anupam Gupta Tim Roughgarden Bell Labs CMU Cornell joint.
Randomized Algorithms and Randomized Rounding Lecture 21: April 13 G n 2 leaves
Primal Dual Method Lecture 20: March 28 primaldual restricted primal restricted dual y z found x, succeed! Construct a better dual.
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations Svetlana Olonetsky Joint work with Amos Fiat, Haim Kaplan, Meital.
A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.
Robust Network Design with Exponential Scenarios By: Rohit Khandekar Guy Kortsarz Vahab Mirrokni Mohammad Salavatipour.
Matroids, Secretary Problems, and Online Mechanisms Nicole Immorlica, Microsoft Research Joint work with Robert Kleinberg and Moshe Babaioff.
Increasing graph connectivity from 1 to 2 Guy Kortsarz Joint work with Even and Nutov.
Greedy Algorithms Reading Material: Chapter 8 (Except Section 8.5)
An Approximation Algorithm for Requirement cut on graphs Viswanath Nagarajan Joint work with R. Ravi.
On Stochastic Minimum Spanning Trees Kedar Dhamdhere Computer Science Department Joint work with: Mohit Singh, R. Ravi (IPCO 05)
1 Introduction to Approximation Algorithms Lecture 15: Mar 5.
Near-Optimal Network Design With Selfish Agents Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler STOC’03, June 9–11, 2003, San Diego, California,
Priority Models Sashka Davis University of California, San Diego June 1, 2003.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
Approximation Algorithms: Bristol Summer School 2008 Seffi Naor Computer Science Dept. Technion Haifa, Israel TexPoint fonts used in EMF. Read the TexPoint.
Approximation Algorithms for Graph Routing Problems Julia Chuzhoy Toyota Technological Institute at Chicago.
Outline Introduction The hardness result The approximation algorithm.
1/24 Algorithms for Generalized Caching Nikhil Bansal IBM Research Niv Buchbinder Open Univ. Israel Seffi Naor Technion.
Approximation Algorithms for Stochastic Combinatorial Optimization Part I: Multistage problems Anupam Gupta Carnegie Mellon University.
V. V. Vazirani. Approximation Algorithms Chapters 3 & 22
Competitive On-Line Admission Control and Routing By: Gabi Kliot Presentation version.
Guy Even & Moti Medina EE Tel-Aviv University Gregor Schaffrath & Stefan Schmid Deutsche Telekom Labs, TU Berlin.
Yossi Azar Tel Aviv University Joint work with Ilan Cohen Serving in the Dark 1.
1 By: MOSES CHARIKAR, CHANDRA CHEKURI, TOMAS FEDER, AND RAJEEV MOTWANI Presented By: Sarah Hegab.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.
Randomized Online Algorithm for Minimum Metric Bipartite Matching Adam Meyerson UCLA.
Approximation and Hardness Results for Packing Cycles Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint work with M.
Approximation Algorithms Department of Mathematics and Computer Science Drexel University.
Multicommodity flow, well-linked terminals and routing problems Chandra Chekuri Lucent Bell Labs Joint work with Sanjeev Khanna and Bruce Shepherd Mostly.
A Optimal On-line Algorithm for k Servers on Trees Author : Marek Chrobak Lawrence L. Larmore 報告人:羅正偉.
Frequency Capping in Online Advertising Moran Feldman Technion Joint work with: Niv Buchbinder,The Open University of Israel Arpita Ghosh,Yahoo! Research.
Approximating the k Steiner Forest and Capacitated non preemptive dial a ride problems, with almost uniform weights Guy Kortsarz Joint work with Dinitz.
New algorithms for Disjoint Paths and Routing Problems
Matroids, Secretary Problems, and Online Mechanisms Nicole Immorlica, Microsoft Research Joint work with Robert Kleinberg and Moshe Babaioff.
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees Mohammad T. Hajiaghayi (CMU) Guy Kortsarz (Rutgers) Mohammad R. Salavatipour (U. Alberta) Presented.
1 Approximation Algorithms for Generalized Scheduling Problems Ravishankar Krishnaswamy Carnegie Mellon University joint work with Nikhil Bansal, Anupam.
Steiner Tree Problem Given: A set S of points in the plane = terminals
Approximation Algorithms Greedy Strategies. I hear, I forget. I learn, I remember. I do, I understand! 2 Max and Min  min f is equivalent to max –f.
Approximation Algorithms based on linear programming.
Multiroute Flows & Node-weighted Network Design Chandra Chekuri Univ of Illinois, Urbana-Champaign Joint work with Alina Ene and Ali Vakilian.
New Algorithms for Disjoint Paths Problems Sanjeev Khanna University of Pennsylvania Joint work with Chandra Chekuri Bruce Shepherd.
Unconstrained Submodular Maximization Moran Feldman The Open University of Israel Based On Maximizing Non-monotone Submodular Functions. Uriel Feige, Vahab.
Maximum Matching in the Online Batch-Arrival Model
Randomized Algorithms CS648
Autumn 2015 Lecture 11 Minimum Spanning Trees (Part II)
Dynamic and Online Algorithms for Set Cover
Approximation Algorithms
Problem Solving 4.
Online Algorithms via Projections set cover, paging, k-server
Optimization Problems Online with Random Demands
Randomized Online Algorithm for Minimum Metric Bipartite Matching
Clustering.
Submodular Maximization with Cardinality Constraints
Presentation transcript:

A General Approach to Online Network Optimization Problems Seffi Naor Computer Science Dept. Technion Haifa, Israel Joint work: Noga Alon, Yossi Azar, Baruch Awerbuch, and Niv Buchbinder

The Set Cover Problem Input: X = 1, 2,...,n – ground set of elements. S – family of subsets of X. c – cost function on S. Goal: A min cost collection of sets from S that cover X. Classic: greedy algorithm is an O(logn)- approximation.

The Online Set Cover Problem An adversary gives the elements one-by-one to the algorithm. When a new element arrives, the algorithm must cover it by a set from S. X’ – Elements given by adversary ( ). Competitive Factor:

Example (1) The sets are servers and the elements are potential clients. Each server can provide the service to a subset of the clients. There is a setup cost for activating a server. Clients arrive one-by-one.

Example (2) Input: X = {1,2, …,n} – a ground set. S – All subsets of X of size. Game: Adversary gives uncovered element at each step. Online algorithm picks a set. Termination: All elements are covered: Performance: Competitive ratio is at least

Example (2) (contd.) Good news or bad news? Not so bad … Competitive Ratio is O(log m). Depends on both n and m (unlike offline case).

Graphical Representation r e a babcedc Request for element a: Purchase a path from r to a leaf labeled a.

Network Optimization Problems Network = Weighted graph, directed or undirected Demands: Disjoint sets of vertices D i = (S i, T i ) Problems: Connectivity - Connect the sets by “picking” edges such that there is path from a vertex in S i to a vertex in T i.

Network Optimization Problems (contd.) Problems (contd.): Cuts - Disconnect the sets by “removing” edges such that each vertex in S i is disconnected from each vertex in T i. Goal: Minimize the total cost of picked or removed edges.

Online Network Optimization Problems Network and weight function are known in advance to the online algorithm. The demands D i = (S i, T i ) are given one-by-one. Each demand is satisfied upon arrival by purchasing edges. Competitive factor is ratio between: cost of edges purchased by the online algorithm and cost of optimal solution.

Connectivity Problems - Examples Online (Non-Metric) Facility Location: There are potential locations of facilities. Each location has a “setup cost”. Clients arrive one-by-one. Each client may connect to each facility by paying a “connection cost”. Goal: Decide which facilities to open to minimize the total cost: “Total Opening Cost” + “Total Connection Cost”

Non-Metric Facility location - Demo ∞

Connectivity Problems - Examples Online Multicast Problem: A family of arbitrary rooted trees, where the tree edges have costs. Each tree leaf is associated with a subset of the clients. Clients arrive one-by-one. Upon arrival of a client: a path from a leaf (associated with the client) to a root has to be purchased. Goal: Minimize cost of purchased edges.

The Multicast Problem

Connectivity Problems - Examples Online Group Steiner problem in trees: Same as the multicast problem – but now there is a single arbitrary rooted tree. This means that paths from leaves associated with the same client to the root are not necessarily disjoint. Goal: Minimize total cost of purchased edges.

Online Group Steiner in Trees Problem

Cuts Problem - Example Online Multicut Problem: General weighted undirected Graph Demands: pairs of vertices D i = (s i, t i ) Goal: Disconnect each pair D i = (s i, t i ) by removing edges from the graph. Minimize the total cost of edges.

Online Multi-cut Problem S3S3 T3T3 S1S1 T1T1 S2S2 T2T2

Fractional Network Problems For each demand (S,T): Connectivity Problems: Give fractional weights to edges s. t. maximum flow from S to T is at least 1. Minimize  c(e) w(e) Cut Problems: Give fractional weights to edges s. t. distance from S from T (closest vertices) is at least 1. Minimize  c(e) w(e)

General Approach to Online Optimization Problems Two Steps: Generate in an online fashion a fractional solution such that: Cost of online fractional solution is close to cost of optimal fractional solution. Round the fractional solution online into an integral solution such that: Cost of integral solution is close to cost of fractional solution.

First Part: Online Fractional Solution Connectivity Problems: Optimal Cost – W* Cost of edges – [1, 2m 2 ] (m = num. of edges) Initially: Give each edge weight = 1/(2m 3 ) Total initial weight: m edges Maximal cost of edge – 2m 2  Total initial cost at most 1

Algorithm – Online connectivity If maximum flow from S to T is at least 1: Do nothing Else: While the flow is less than 1: 1.Compute minimum cut C between S and T 2.For each edge e in the cut: w(e)  w(e)[1+ 1/c(e)] New demand D = (S, T):

The Algorithm - Analysis Lemma: The total number of weight increments during the algorithm is O(W* logm) Proof: Potential function:

Analysis – cont. Initial value of the potential function is: -2W* log 2 (2m) Initial weights of edges: w e = 1/(2m 3 ). The potential function never exceeds: 2W* The weight of each edge is at most 2. Each time weights are increased, the potential function increases by at least 1.

Analysis – cont. Proof of third fact: First inequality – (c e ≥ 1) Second inequality – OPT is feasible.

The Algorithm – Competitive Ratio Theorem: The algorithm is O(log m) competitive. Proof: 1.The initial value of the solution is at most 1. 2.Each time the algorithm increases weights, the cost it pays increases by:  c(e) w(e)/c(e) =  w(e) ≤ 1 (The minimum cut is at most 1) 3.There are O(W* log m) weight increments in the algorithm.

Online Multicut - Algorithm If the shortest path from S to T is at least 1 Do nothing Else: While the distance is less than 1: 1.Compute a shortest path P between S and T 2.For each edge e in the path P : w(e)  w(e)[1+ 1/c(e)] New demand D = (S, T):

The Algorithm – Competitive Ratio Theorem: The algorithm for generating a fractional multicut online is O(log m) competitive. Proof: Similar Analysis

Lower Bounds Lemma: Any deterministic (and randomized) online algorithm for the fractional connectivity and fractional cuts problem has a competitive ratio of at least Ω(log m) Remarks: 1.Holds even with respect to the optimal integral solution.

Rounding the Fractional Solution The rounding is problem specific. Results: 1.Set cover, non-metric facility location and multicast – O(logn logm)- competitive algorithm. m – number of possible facilities. n – number of clients. Remark: Lower bound for deterministic algorithm for online set cover – almost tight.

Rounding the Fractional Solution (cont.) Results (cont.): 2.Online group Steiner Problem: 1.Trees: O(logk log N logn) 2.General Graphs: O(logk log N log 2 n) n – number of vertices in the graph k – number of clients N – maximal size of a group ( at most n) Remark: General Graphs via HST’s

Rounding the Fractional Solution Example: Online Set Cover Problem. Offline case: Classic “randomized rounding”: Choose each set S with probability O(w(S)logn): Elements are covered with high probability. Expected cost is fractional cost x O(logn).

Rounding the Fractional Solution Online case: randomized rounding on the “increments” of the fractional increase. In each weight augmentation: w(S)  w(S)[1+1/c(S)] Repeat O(logn) times: Choose Set S with probability w(S)/c(S). Surprisingly, this can be de-randomized online using a suitable potential function [AAABN, STOC ’03].

Rounding the Fractional Solution Example: Multicast problem on trees For each tree: choose 2logn’ r. v. uniformly in [0,1]. (n’ – # terminals so far) Threshold of a tree: minimum r. v. Online Rounding: Take an edge if weight exceeds tree threshold. (Weights on a path – monotone non-increasing) Open: Can it be de-randomized? (even for facility location.)

Online Multicut Problem Techniques: 1.Raecke’s hierarchical decomposition of a graph into a tree. (Harrelson, Hidrum, Rao). 2.Ratio of Minimum Cut / Maximum multi- commodity Flow in trees is at most 2. 3.Simple online primal-dual algorithm on trees.

Online Multicut Problem Results: Deterministic online algorithm for the multicut problem with competitive ratio: O(log 3 n loglogn) for general graphs. O(log 2 n loglogn) for planar graphs. O(log 2 n) for trees. n – number of vertices

Thank you!