Primal-dual algorithms for node-weighted network design in planar graphs Grigory Yaroslavtsev Penn State (joint work with Piotr Berman)

Slides:

Advertisements

Similar presentations

Improved Approximation for the Directed Spanner Problem Grigory Yaroslavtsev Penn State + AT&T Labs - Research (intern) Joint work with Berman (PSU), Bhattacharyya.

Advertisements

Network Design with Degree Constraints Guy Kortsarz Joint work with Rohit Khandekar and Zeev Nutov.

Prize-collecting Frameworks Mohammad T. HajiAghayi University of Maryland, College Park & AT&T Labs-- Research TexPoint fonts used in EMF. Read the TexPoint.

Online Node-weighted Steiner Connectivity Problems Vahid Liaghat University of Maryland MohammadTaghi Hajiaghayi (UMD) Debmalya Panigrahi (Duke) 1.

Approximation Algorithms

The Fault-Tolerant Group Steiner Problem Rohit Khandekar IBM Watson Joint work with G. Kortsarz and Z. Nutov.

Minimum Spanning Tree Sarah Brubaker Tuesday 4/22/8.

CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov

The Analysis and Design of Approximation Algorithms for the Maximum Induced Planar Subgraph Problem Kerri Morgan Supervisor: Dr. G. Farr.

Reuven Bar-Yehuda Gleb Polevoy Gleb Polevoy Dror Rawitz Technion Technion 1.

Minimum Vertex Cover in Rectangle Graphs R. Bar-Yehuda, D. Hermelin, and D. Rawitz 1.

Reuven Bar-Yehuda Gleb Polevoy Gleb Polevoy Dror Rawitz Technion Technion 1.

Randomized Algorithms for the Loop Cutset Problem Author: Ann Becker, Beuven Bar-Yehuda Dan Geiger Beuven Bar-Yehuda Dan Geiger Class presentation for.

Seminar : Approximation algorithms for LP/IP optimization problems Reuven Bar-Yehuda Technion IIT Slides and papers at:

1 Internet Networking Spring 2006 Tutorial 6 Network Cost of Minimum Spanning Tree.

Approximation Algorithm: Iterative Rounding Lecture 15: March 9.

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.

1 Seminar : Approximation algorithms for LP optimization problems Reuven Bar-Yehuda Technion IIT Slides and paper at:

1 A Unified Approach to Approximating Resource Allocation and Scheduling Amotz Bar-Noy.……...AT&T and Tel Aviv University.

Multicommodity Rent or Buy: Approximation Via Cost Sharing Martin Pál Joint work with Anupam Gupta Amit Kumar Tim Roughgarden.

A Unified Approach to Approximating Resource Allocation and Scheduling Amotz Bar-Noy.……...AT&T and Tel Aviv University Reuven Bar-Yehuda….Technion IIT.

1 Internet Networking Spring 2004 Tutorial 6 Network Cost of Minimum Spanning Tree.

New Graph Bipartizations for Double-Exposure, Bright Field Alternating Phase-Shift Mask Layout Andrew B. Kahng (UCSD) Shailesh Vaya (UCLA) Alex Zelikovsky.

Vertex cover problem S  V such that for every {u,v}  E u  S or v  S (or both)

Using Homogeneous Weights for Approximating the Partial Cover Problem

Steiner trees Algorithms and Networks. Steiner Trees2 Today Steiner trees: what and why? NP-completeness Approximation algorithms Preprocessing.

Power Optimization for Connectivity Problems MohammadTaghi Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov IPCO 2005.

Design and Analysis of Algorithms Minimum Spanning trees

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

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.

Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.

Minimum Spanning Tree Algorithms. What is A Spanning Tree? u v b a c d e f Given a connected, undirected graph G=(V,E), a spanning tree of that graph.

Outline Introduction The hardness result The approximation algorithm.

Network Design and Bidimensionality Mohammad T. Hajiaghayi University of Maryland.

V. V. Vazirani. Approximation Algorithms Chapters 3 & 22

1 Introduction to Approximation Algorithms. 2 NP-completeness Do your best then.

Simple and Improved Parameterized Algorithms for Multiterminal Cuts Mingyu Xiao The Chinese University of Hong Kong Hong Kong SAR, CHINA CSR 2008 Presentation,

Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.

1 Min-Cost Live Webcast under Joint Pricing of Data, Congestion and Virtualized Servers Rui Zhu 1, Di Niu1, Baochun Li 2 1 Department of Electrical and.

Topics in Algorithms 2005 Constructing Well-Connected Networks via Linear Programming and Primal Dual Algorithms Ramesh Hariharan.

Spanning Trees Introduction to Spanning Trees AQR MRS. BANKS Original Source: Prof. Roger Crawfis from Ohio State University.

Approximation for Directed Spanner Grigory Yaroslavtsev Penn State + AT&T Labs (intern) Based on a paper at ICALP’11, joint with Berman (PSU), Bhattacharyya.

1 Bart Jansen Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter STACS 2011, Dortmund March 10 th, 2011 Joint work with.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Lecture 19 Greedy Algorithms Minimum Spanning Tree Problem.

Approximation Algorithms for Prize-Collecting Forest Problems with Submodular Penalty Functions Chaitanya Swamy University of Waterloo Joint work with.

CS774. Markov Random Field : Theory and Application Lecture 02

Experimental Study of Directed Feedback Vertex Set Problem With Rudolf Fleischer and Liwei Yuan Fudan University, Shanghai Xi Wu.

Projects Network Theory VLSI PSM 1. Network 1. Steiner trees

WK15. Vertex Cover and Approximation Algorithm By Lin, Jr-Shiun Choi, Jae Sung.

Two Dimension Measures: A New Algorithimic Method for Solving NP-Hard Problems Yang Liu.

New algorithms for Disjoint Paths and Routing Problems

Variations of the Prize- Collecting Steiner Tree Problem Olena Chapovska and Abraham P. Punnen Networks 2006 Reporter: Cheng-Chung Li 2006/08/28.

1 A Unified Approach to Approximating Resource Allocation and Scheduling Amotz Bar-Noy.……...AT&T and Tel Aviv University.

Lecture 25 NP Class. P = ? NP = ? PSPACE They are central problems in computational complexity.

Graph Concepts and Algorithms Using LEDA By Caroline Moore and Carmen Frerichs (252a-at and 252a-ao) each graph in the presentation was created using gw_basic_graph_algorithms.

Steiner Tree Problem Given: A set S of points in the plane = terminals

Improved Steiner Tree Approximation in Graphs SODA 2000 Gabriel Robins (University of Virginia) Alex Zelikovsky (Georgia State University)

Multiroute Flows & Node-weighted Network Design Chandra Chekuri Univ of Illinois, Urbana-Champaign Joint work with Alina Ene and Ali Vakilian.

The 2x2 Simple Packing Problem André van Renssen Supervisor: Bettina Speckmann.

Chapter 8 PD-Method and Local Ratio (5) Equivalence This ppt is editored from a ppt of Reuven Bar-Yehuda. Reuven Bar-Yehuda.

Steiner trees: Approximation Algorithms

Chapter 8 Local Ratio II. More Example

Seminar : Approximation algorithms for LP/IP optimization problems

Connected Components Minimum Spanning Tree

Iterative Deletion Routing Algorithm

Minimum Spanning Trees (MSTs)

Integrating Class Hierarchies

Presentation transcript:

Primal-dual algorithms for node-weighted network design in planar graphs Grigory Yaroslavtsev Penn State (joint work with Piotr Berman)

Feedback Vertex Set Problems Given: a collection of cycles in a graph Goal: break them, removing a small # of vertices Example: Collection = All cycles X X Weighted vertices => remove set of min cost

FVS: Flavors and toppings All cycles = Feedback Vertex Set All Directed cycles = Directed FVS All odd-length cycles = Bipartization Cycles through a subset of vertices = Subset FVS X

FVS in general graphs NP-hard (even in planar graph [Yannakakis]) ProblemApproximation FVS2 [Becker, Geiger; Bafna, Berman, Fujito] Bipartization Directed FVS Subset FVS8 [Even, Naor, Zosin]

FVS in planar graphs (via primal-dual) NP-hard (even in planar graph [Yannakakis]) ProblemsPrevious workThis work FVS 10 [Bar-Yehuda, Geiger, Naor, Roth] 3 [Goemans, Williamson, 96] 2.4 (2.57) BIP, D-FVS, S-FVS Node-Weighted Steiner Forest 6 [Demaine, Hajiaghayi, Klein’09] 3 [Moldenhauer’11] More general class of problems

Bigger picture General Graphs Planar Vertices Weights Edges Feedback Edge Set in general graphs = Complement of MST Planar edge-weighted BIP and D-FVS are also in P Planar edge-weighted Steiner Forest has a PTAS [Bateni, Hajiaghayi, Marx, STOC’11] Planar unweighted Feedback Vertex Set has a PTAS [Baker; Demaine, Hajiaghayi, SODA’05]

Class 1: Uncrossing property ⇒ ⇒

Proper functions [GW, DHK]

Class 2: Hitting set IP [DHK] ⇒ ⇒

Class 1 = Class 2

Primal-dual method (local-ratio version)

Oracle 1 = Face-minimal cycles [GW]

Oracle 2 = Pocket removal [GW]

Oracle 3 = Triple pocket removal

Open problems

Applications and ramifications Applications: from maintenance of power networks to computational sustainability Example: VLSI design. Primal-dual approximation algorithms of Goemans and Williamson are competitive with heuristics [Kahng, Vaya, Zelikovsky] Connections with bounds on the size of FVS Conjectures of Akiyama and Watanabe and Gallai and Younger [see GW for more details]

Approximation factor