Approximating the two-source minimum routing cost spanning trees Bang Ye Wu Shu-Te University.

Slides:

Advertisements

Similar presentations

Chapter 4 Partition I. Covering and Dominating.

Advertisements

Graphs: basic definitions and notation Definition A (undirected, unweighted) graph is a pair G = (V, E), where V = {v 1, v 2,..., v n } is a set of vertices,

Approximation Algorithms

Design and Analysis of Algorithms Approximation algorithms for NP-complete problems Haidong Xue Summer 2012, at GSU.

The swap edges of a multiple source routing tree * 樹德資工 † 台大資工 Bang Ye Wu* Chih-Yuan Hsiao † Kun-Mao Chao †

Greedy Algorithms Spanning Trees Chapter 16, 23. What makes a greedy algorithm? Feasible –Has to satisfy the problem’s constraints Locally Optimal –The.

1 A Faster Approximation Algorithm For The Steiner Problem In Graphs Kurt Mehlhorn. Information Processing Letters, 27(3):125–128, 高等演算法二

1 The TSP : Approximation and Hardness of Approximation All exact science is dominated by the idea of approximation. -- Bertrand Russell ( )

End Topics Approximate Vertex Cover Approximate TSP Tour Computation of FFT P, NP, NP Complete, NP hard.

Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.

Minimum Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan

Spanning Trees in Communication Networks Rui Campos INESC Porto, Faculdade de Engenharia, Universidade do Porto

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

3 -1 Chapter 3 The Greedy Method 3 -2 The greedy method Suppose that a problem can be solved by a sequence of decisions. The greedy method has that each.

Approximation Algorithms1. 2 Outline and Reading Approximation Algorithms for NP-Complete Problems (§13.4) Approximation ratios Polynomial-Time Approximation.

1 Approximation Algorithms CSC401 – Analysis of Algorithms Lecture Notes 18 Approximation Algorithms Objectives: Typical NP-complete problems Approximation.

A general approximation technique for constrained forest problems Michael X. Goemans & David P. Williamson Presented by: Yonatan Elhanani & Yuval Cohen.

Greedy Algorithms Reading Material: Chapter 8 (Except Section 8.5)

Routing 1 Outline –What is Routing? –Why Routing? –Routing Algorithms Overview –Global Routing –Detail Routing –Shortest Path Algorithms Goal –Understand.

Approximation Algorithms for the Traveling Salesperson Problem.

A 2-Approximation algorithm for finding an optimum 3-Vertex-Connected Spanning Subgraph.

9-1 Chapter 9 Approximation Algorithms. 9-2 Approximation algorithm Up to now, the best algorithm for solving an NP-complete problem requires exponential.

Greedy Algorithms Like dynamic programming algorithms, greedy algorithms are usually designed to solve optimization problems Unlike dynamic programming.

9-1 Chapter 9 Approximation Algorithms. 9-2 Approximation algorithm Up to now, the best algorithm for solving an NP-complete problem requires exponential.

Approximation Algorithms Motivation and Definitions TSP Vertex Cover Scheduling.

Approximation Algorithms

Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Graph Algorithms: Minimum.

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

© The McGraw-Hill Companies, Inc., Chapter 3 The Greedy Method.

1 Quantum query complexity of some graph problems C. DürrUniv. Paris-Sud M. HeiligmanNational Security Agency P. HøyerUniv. of Calgary M. MhallaInstitut.

The Traveling Salesman Problem Approximation

COMP108 Time Complexity of Pseudo Code. Example 1 sum = 0 for i = 1 to n do begin sum = sum + A[i] end output sum O(n)

Chandra Chekuri, Nitish Korula and Martin Pal Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms (SODA 08) Improved Algorithms.

COSC 2007 Data Structures II Chapter 14 Graphs III.

Minimum Routing Cost Spanning Trees Kun-Mao Chao ( 趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan.

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.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

Week 10Complexity of Algorithms1 Hard Computational Problems Some computational problems are hard Despite a numerous attempts we do not know any efficient.

Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Approximation Algorithms These lecture slides are adapted from CLRS.

1 The Floyd-Warshall Algorithm Andreas Klappenecker.

CSE 2331 / 5331 Topic 12: Shortest Path Basics Dijkstra Algorithm Relaxation Bellman-Ford Alg.

Minimum Spanning Trees CS 146 Prof. Sin-Min Lee Regina Wang.

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

Approximation Algorithms for TSP Tsvi Kopelowitz 1.

1 Prim’s algorithm. 2 Minimum Spanning Tree Given a weighted undirected graph G, find a tree T that spans all the vertices of G and minimizes the sum.

Pathfinding Algorithms for Mutating Weight Graphs Haitao Mao Computer Systems Lab

Prims Algorithm for finding a minimum spanning tree

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

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.

Minimum Spanning Tree Chapter 13.6.

Approximation Algorithms

COMP 6/4030 ALGORITHMS Prim’s Theorem 10/26/2000.

Approximation Algorithms

Minimum Spanning Tree Neil Tang 3/25/2010

Connected Components Minimum Spanning Tree

Minimum Spanning Trees

4-4 Graph Theory Trees.

Kruskal’s Algorithm for finding a minimum spanning tree

Minimum Spanning Tree Neil Tang 4/3/2008

Minimum Spanning Trees

A p r o x i m a t n l g h s f e - u c D i s c r e t A p l d M a h m 1

Weighted Graphs & Shortest Paths

Lecture 19 Linear Program

Minimum Spanning Trees

Graphs G = (V,E) V is the vertex set.

Minimum Spanning Trees

Presentation transcript:

Approximating the two-source minimum routing cost spanning trees Bang Ye Wu Shu-Te University

Problem Definition Input: an undirected graph with nonnegative edge lengths, two vertices as sources and all vertices as destinations Output: a spanning tree such that the total distance from sources to destinations (including the sources) is minimum, that is, we want to minimize

Result The NP-hardness of the problem. A PTAS: for any  >0, the scheme finds a (1+  )-approximation solution with time complexity

Related problems OCT:  ij d T (i,j), arbitrary nonnegative requirements. MRCT: requirement=1 PROCT: ij =r i *r j, r i is nonnegative vertex weight SROCT: ij =r i +r j k-MRCT is a special case of SROCT. The sources have weight 1 and others have weight 0

OCT problems

Previous results problemApprox. ratioreference OCTO(lognloglogn)SICOMP PROCTPTASJALG SROCT2DAM MRCTPTASSICOMP

Future research k-MRCT, fixed k and arbitrary k K-OCT, fixed k and arbitrary k On the plane