Javier Cordova. Abstract. In this paper the following problem is considered: given a root node R in a
|
|
- Bathsheba Jordan
- 5 years ago
- Views:
Transcription
1 TR94025 A Heuristic Algorithm for the Rectilinear Steiner Arborescence Problem Javier Cordova Computer Science Department University of Puerto Rico Arecibo, PR 0013 YannHang Lee Computer and Information Sciences Department University of Florida Gainesville, FL 3211 August 17, 1994 Abstract In this paper the following problem is considered: given a root node R in a mesh and a set D of nodes from the mesh, construct a shortestpath tree rooted at R that spans the set D and minimizes the number of links used. The problem is equivalent as nding a Steiner tree in a directed mesh in which all the links point away from the root node R. The problem of nding a Steiner tree in such grid has been known in the literature as the Rectilinear Steiner Arborescence (RSA) problem. Rao et. al [9] have proposed an ecient heuristic algorithm for a special case of this problem, in which all the nodes in D lie in the rst quadrant of E 2 (assuming the tree is rooted at the origin). The algorithm has time complexity of O(j D j log j D j). They proved that the trac generated by the heuristic has an upper bound of twice of that generated by any optimal algorithm. They have proposed an extension of this algorithm that solves the general case in which the nodes in D lie anywhere in the plane that runs with O(j D j 3 log j D j) time complexity. We propose in this work a similar heuristic with same upper bound that also has time complexity O(j D j log j D j) but solves this general case in which the nodes are allowed to be anywhere in E 2. 1
2 1 Introduction Consider a mesh network in which a root node R is given. Let D be a set of nodes from the mesh. We want to build a shortestpath tree rooted at R that spans the set D and minimizes the number of links used. In a shortestpath tree the distance between the root and every node in the tree is minimized. Constructing a shortestpath tree with lowest trac rooted at node R (grid M in the gure below) is equivalent to nding a rectilinear directed Steiner tree rooted at R in a directed mesh in which all the links are directed away from R (M 0 in the gure). M M 0 R R s s The problem of nding a Steiner tree given a set of points in a plane using rectilinear distances has been proved to be an NPComplete problem [4]. On the other hand, the problem of nding a rectilinear directed Steiner tree has been known in the literature as the Rectilinear Steiner Arborescence (RSA) problem. The problem here is to nd a Steiner directed tree for a set D of nodes lying in the grid, rooted at point R, using only horizontal and vertical arcs oriented away from R. Rao et. al [9] have studied the Rectilinear Steiner Arborescence problem when the set D lies in the rst quadrant ofe 2, and the directed tree is rooted at the origin. They proposed a heuristic algorithm in which a Steiner tree H for D is generated by iterative substitution. The algorithm has time complexity O(j D j log j D j). They have shown that l(h) 2l(RSMA), where l(a) isthenumber of links in the tree A and an RSM A (Rectilinear Steiner Minimum Arborescence) is an optimal RSA. They proposed a solution to the general RSA problem in which D is allowed to lie anywhere in E 2. They reduced the problem to the rst quadrant version by restricting the arborescence to contain the xaxis only between a and b (a 0 b), and the yaxis only between c and d (c 0 d). Using the previous algorithm the best RSA in each quadrant satisfying these conditions can be determined (for the best restricted RSA in the rst quadrant, for example, all j D j 2 possible choices of b and d have to be examined, taking 2
3 O(j D j 3 log j D j) time). The best RSA in E 2 is obtained by taking the best among all restricted RSAs. We propose a similar heuristic, on the other hand, which is a simple extension of their algorithm and generates a suboptimal RSMA when D lies anywhere in the grid, maintains the same upper bound for the number of links in the tree, and can be implemented in a similar way with time complexity being also O(j D j log j D j). The heuristic is summarized in the following. 2 Heuristic Algorithm For two grid points p and q, let max o (p q) be the grid point that maximizes the overlapping in the shortest paths from the origin to the points p and q. The point max o (p q) is dened in the following way, given that p =(x p y p ), q =(x q y q ), for z = x or y coordinates: if z p z q 0 then the zcoordinate of max o is given by min(z p z q ). Else if z p z q 0 then the zcoordinate is max(z p z q ). Otherwise it is 0. We assume that the root of the tree is the origin. This denition of max o (p q) allows us to combine points from adjacent quadrants. This was not handled by the algorithm proposed in [9]. Let L z denote the four lines lying in the grid given by j x j + j y j= z. A set of points P is a cover for a set of points Q if 8q 2 Q there exists a point p 2 P with a path from p to q. Let Q z be the subset of Q lying above L z. Then let MC(Q z) denote the set of points on L z with minimum cardinality thatcovers Q z. It follows directly from this Denition that any RSA for D intersects L z at least MC(D z) times for every z. A heuristic algorithm generates a suboptimal RSA (SRSA)by iteratively substituting two points in D by the point max o (p q)until the origin remains. Again, the pair of points p q are chosen to maximize jj max o (p q) jj. Let D z denote the set D at the point in the construction of the SRSA in which the last possible pair of points p q having jj max o (p q) jj z have been joined, and let W z = fp 2 D z :jj p jj zg. The nodes in the initial set D are called sinks. Lemma 1 During the construction of the SRSA, for any z 0, there can be at most one point in W z on or above the horizontal line y =(0 z) (also, there is at most one point in W z on or below the horizontal line y =(0 ;z), at most one point on or to the right of the vertical line x =(z 0) and at most one on or to the left of the vertical line x =(;z 0)). 3
4 Proof: Let p q 2 W z with y p y q z. Let y p y q. Then max o (p q) =(x y q ) for some value x. Hence jj (x y q ) jjz, contradicting the fact that p q 2 W z. A similar proof works for the other 3 lines. 2 The following lemma is an adapted version of lemma 4 in [9]. Lemma 2 Let p i =(x i y i ) be apoint in a SRSA generated by the heuristic. If x i =0 and y i =0, then there must exist a sink on the vertical path x = x i (horizontal path y = y i ) starting at p i. Proof: Assume, w:l:g:, that p i lies in the rst quadrant. The proof is by induction on the number of descendents in the tree of p i.ifp i does not have descendents then it is a sink, and the result immediately follows. Suppose, on the contrary, that p i = max o (p j p k ). Observe that these two points belong also to the rst quadrant. Thus x i = min(x j x k ), say x k, and y k y i. By induction there is a sink on the vertical path x = x k starting at p j.the fact that y k y i implies that this sink is also on the vertical path x = x i = x k staring at p i. A similar argument can be made for the ycoordinate. 2 Now assume that the points p and q lie in the rst quadrant. lemmas are taken directly from [9]. The proofs can be found in their paper. The following two Lemma 3 During the construction of the SRSA, for any z 0 and p q 2 W z, 1. x p = x q and y p = y q, 2. x p <x q if and only if y p >y q, 3. if x p <x q, then x p + y q <z. Lemma 4 Let p q 2 W z with x p <x q. Then there exists a sink either on the horizontal path between p and (x p y p ) or on the vertical path between (x q y p ) and q. It is straight forward to prove similar results when both of the points p and q lie in any of the other three quadrants. The following theorem provides an upper bound for the trac generated for the multicast tree by the heuristic. Its proof is similar to the proof of the upper bound provided in [9]. 4
5 Theorem 1 l(srsa) 2l(RSM A). Proof: First, note that for any RSA A, l(a) = P z(a\l z ). Weknowthatj L z \A jj MC(D z) j for any RSA A. Thus it is sucient toshowthatj SRSA \ L z j 2 j MC(D z) j for any z. For any given z, order the points in W z into p1 p2 ::: p jwzj circularly as follows: rst take the nodes in the rst quadrant and order them by increasing values of the xcoordinates (with x1 > 0), then the nodes in the second quadrant by decreasing order of the xcoordinate, and so on. It can be shown that MC(D z) must contain distinct points for each pair of points p2i;1 p2i, fori =1 2 ::: bj W z j =2c. Consider the two pairs of points (p2i;1 p2i), and (p2i+1 p2i+2), for any given i in the above range. Assume, for simplicity, that these points lie in the rst quadrant. By Lemma 4 there must exist a sink on the horizontal path y = y2i;1 between p2i;1 and (x2i y2i;1) oronthevertical path x = x2i between (x2i y2i;1) and p2i. Hence MC(D z) must contain a point whose xcoordinate lies between z ;y2i;1 and x2i. Also, there is a sink on the horizontal path y = y2i+1 between p2i+1 and (x2i+2 y2i+1) or on the vertical path x = x2i+2 between (x2i+2 y2i+1) andp2i+2. Hence MC(D z) must contain a point whose xcoordinate lies between z ; y2i+1 and x2i+2. Since x2i + y2i+1 <zby Lemma 3, then the above two points are dierent. A similar result holds no matter where the points lie. Thus MC(D,z) contains at least bj W z j =2c points. This implies that if j W z j is even, then the SRSA generated by the heuristic intersects L z If j W z j is odd, then consider p1. Case 1: x p1 =0. By Lemma 2, there is a sink s on the vertical path x = x p1 at most 2 j MC(D z) j times. starting at p1. Thus MC(D z) must contain a point whose xcoordinate is between 0 and x p1. For the rest of the j W z j;1 points in W z there correspond at least (j W z j ;1)=2 distinct points in MC(D z), and it is easy to see that these points mustbedierent from the point in MC(D z) corresponding to p1. 1 Thus MC(D z) contains at least j Wz points. j =2 distinct 1 We can assume here that jj pw z jj< z. Otherwise, we can order the nodes circularly the other way around, starting with pw z and nishing with p 1. 5
6 Case 2: x p1 =0. We can assume now thatw z contains points on or above the points (0 z) (z 0) (0 ;z) (;z 0) in the same vertical or horizontal lines. Otherwise, we could order the points in W z starting with the points in some other quadrant and reduce the problem to Case 1. Assume, w:l:g:, that there are 2c points in W z in the rst quadrant, for some positive integer c. Note that since now we are assuming that j W z j is odd, at least one quadrant must have aneven number of points in W z. Thus MC(D z) must contain at least c points in the rst quadrant. Case 2a: MC(D z) contains at least c +1points in the rst quadrant. MC(D z) must contain at least b(j W z j;2c)=2c distinct points in the other three quadrants. Thus MC(D z) contains at least bj W z j =2c ;c + c +1>j W z j =2 distinct points. Case 2b: MC(D z) contains exactly c points in the rst quadrant. We will show that at least one of the points (0 z)or(z 0) cannot be one of these c points in MC(D z). Consider the rst 2c ; 2points in W z in the rst quadrant, not including p1. There must be c ;1 distinct points in MC(D z) tocover them, and none of them is (0 z)or(z 0). Thus one of these two points is not in MC(D z). Assume, w:l:g:, that p1 2 MC(D z). Thus between x p Wz and 0 there is a dierent point inmc(d z) required to cover the sink on or above p Wz. For the rest of the j W z j;2c ; 1 points in W z there must be (j W z j;2c ; 1)=2 distinct points in MC(D z). Thus MC(D z) contains at least bj W z j =2c ;c + c +1>j W z j =2 distinct points. Thus W z contains at most 2 j MC(D z) j points, and therefore the SRSA generated intersects L z at most 2 j MC(D z) j times. Since z is arbitrary this holds for any z, and the theorem is proved. 2 The implementation presented in [9] for their algorithm can be adapted for our algorithm. The key idea is that Steiner points can only be introduced by the heuristic from adjacent points in W z. To implement the algorithm a priority queue is used containing all the sinks below the lines in L z and all the j W z j;1potential new Steiner points max o (p q) for each pair of adjacent points p q 2 W z. See [9] for details of the implementation. To evaluate the performance of the algorithm we ran simulation programs for an 8*8 mesh both for the optimal and the heuristic algorithm. The optimal solution for 100
7 randomly generated groups was found by exhaustive search of all shortestpath trees, and compared to the suboptimal solution found by the heuristic algorithm for the same multicast groups. The trac is the number of links in the multicast tree. The results are shown in the graph above. To get the worst case line we added to the optimal trac for each number of destinations the highest dierence found between the optimal trac and the trac computed by the heuristic. It can be seen that even in the worst case the values computed are much closer to the optimal values than to the upper bound Heuristic Optimal Worst Case Upper Bound 80.0 Traffic Number of Destinations Figure 1: Optimal Algorithm vs Heuristic References [1] Foulds L.R., Graham R.L., "The Steiner Problem in Phylogeny is NPComplete", Advances in Applied Mathematics, Vol. 3, 1982, pp
8 [2] Garey M.R., Graham R., Johnson D.S., "The Complexity of Computing Steiner Minimal Trees", Siam J. of Applied Mathematics, Vol. 32, 1977, pp [3] Garey M.R., Johnson D.S., Computers and Intractability, W.H. Freeman and Company, San Francisco, [4] Garey M.R., Johnson D.S., "The Rectilinear Steiner Tree Problem is NPComplete", SIAM J. of Applied Mathematics, Vol. 32, No. 4, June 1977, pp [5] Hakimi S.L., "Steiner's Problem in Graphs and its Implications", Networks, Vol. 1, 1971, pp [] Hanan M., "On Steiner's Problem with Rectilinear Distance", Siam J. of Applied Mathematics, Vol. 14, 19, pp [7] Hwang F.K., "The Rectilinear Steiner Problem", J. Design and Automation Fault Tolerance Anal, Vol. 2, 1978, pp [8] Hwang F.K., Richards D.S., "Steiner Tree Problems", Networks, Vol. 22, 1992, pp [9] Rao S.K., Sadayappan P., Hwang F., Shor P.W., "The Rectilinear Steiner Arborescence Problem", Algorithmica, 7, 1992, pp [10] Winter P., "Steiner Problem in Networks: A Survey", Networks, Vol. 17, 1987, pp
c 2006 Society for Industrial and Applied Mathematics
SIAM J. COMPUT. Vol. 35, No. 3, pp. 729 740 c 2006 Society for Industrial and Applied Mathematics THE RECTILINEAR STEINER ARBORESCENCE PROBLEM IS NP-COMPLETE WEIPING SHI AND CHEN SU Abstract. Given a set
More informationAn Ecient Approximation Algorithm for the. File Redistribution Scheduling Problem in. Fully Connected Networks. Abstract
An Ecient Approximation Algorithm for the File Redistribution Scheduling Problem in Fully Connected Networks Ravi Varadarajan Pedro I. Rivera-Vega y Abstract We consider the problem of transferring a set
More informationBottleneck Steiner Tree with Bounded Number of Steiner Vertices
Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash Paz Carmi Matthew J. Katz June 18, 2011 Abstract Given a complete graph G = (V, E), where each vertex is labeled either
More informationLocalization in Graphs. Richardson, TX Azriel Rosenfeld. Center for Automation Research. College Park, MD
CAR-TR-728 CS-TR-3326 UMIACS-TR-94-92 Samir Khuller Department of Computer Science Institute for Advanced Computer Studies University of Maryland College Park, MD 20742-3255 Localization in Graphs Azriel
More informationWeak Dynamic Coloring of Planar Graphs
Weak Dynamic Coloring of Planar Graphs Caroline Accurso 1,5, Vitaliy Chernyshov 2,5, Leaha Hand 3,5, Sogol Jahanbekam 2,4,5, and Paul Wenger 2 Abstract The k-weak-dynamic number of a graph G is the smallest
More informationThe Feasible Solution Space for Steiner Trees
The Feasible Solution Space for Steiner Trees Peter M. Joyce, F. D. Lewis, and N. Van Cleave Department of Computer Science University of Kentucky Lexington, Kentucky 40506 Contact: F. D. Lewis, lewis@cs.engr.uky.edu
More informationII (Sorting and) Order Statistics
II (Sorting and) Order Statistics Heapsort Quicksort Sorting in Linear Time Medians and Order Statistics 8 Sorting in Linear Time The sorting algorithms introduced thus far are comparison sorts Any comparison
More informationSubexponential algorithms for rectilinear Steiner tree and arborescence problems
Subexponential algorithms for rectilinear Steiner tree and arborescence problems Fedor V. Fomin Sudeshna Kolay Daniel Lokshtanov Fahad Panolan Saket Saurabh Abstract A rectilinear Steiner tree for a set
More informationThe Complexity of Minimizing Certain Cost Metrics for k-source Spanning Trees
The Complexity of Minimizing Certain Cost Metrics for ksource Spanning Trees Harold S Connamacher University of Oregon Andrzej Proskurowski University of Oregon May 9 2001 Abstract We investigate multisource
More information5. THE ISOPERIMETRIC PROBLEM
Math 501 - Differential Geometry Herman Gluck March 1, 2012 5. THE ISOPERIMETRIC PROBLEM Theorem. Let C be a simple closed curve in the plane with length L and bounding a region of area A. Then L 2 4 A,
More informationMax-Planck Institut fur Informatik, Im Stadtwald, Saarbrucken, Germany,
An Approximation Scheme for Bin Packing with Conicts Klaus Jansen 1 Max-Planck Institut fur Informatik, Im Stadtwald, 66 13 Saarbrucken, Germany, email : jansen@mpi-sb.mpg.de Abstract. In this paper we
More informationSteiner Problems on Directed Acyclic Graphs. November 3, Abstract. In this paper, we consider two variations of the minimum-cost Steiner problem
Steiner Problems on Directed Acyclic Graphs Tsan-sheng Hsu y, Kuo-Hui Tsai yz, Da-Wei Wang yz and D. T. Lee? November 3, 1995 Abstract In this paper, we consider two variations of the minimum-cost Steiner
More informationEulerian subgraphs containing given edges
Discrete Mathematics 230 (2001) 63 69 www.elsevier.com/locate/disc Eulerian subgraphs containing given edges Hong-Jian Lai Department of Mathematics, West Virginia University, P.O. Box. 6310, Morgantown,
More informationTrees with many leaves
Trees with many leaves N. V. Gravin Abstract In this note we consider the problem of nding a spanning tree with large number of leaves. We overview some known facts about this question. In details We consider
More informationGraph Models for Global Routing: Grid Graph
Graph Models for Global Routing: Grid Graph Each cell is represented by a vertex. Two vertices are joined by an edge if the corresponding cells are adjacent to each other. The occupied cells are represented
More informationFace covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia
Face covers and the genus of apex graphs Bojan Mohar Department of Mathematics, University of Ljubljana, 1111 Ljubljana, Slovenia bojan.mohar@uni-lj.si Abstract A graph G is an apex graph if it contains
More informationLecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) January 11, 2018 Lecture 2 - Graph Theory Fundamentals - Reachability and Exploration 1 In this lecture
More informationMax-Cut and Max-Bisection are NP-hard on unit disk graphs
Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz and Marcin Kamiński 2 Llenguatges i Sistemes Informàtics 2 RUTCOR, Rutgers University Universitat Politècnica de Catalunya 640 Bartholomew
More informationPebbling on Directed Graphs
Pebbling on Directed Graphs Gayatri Gunda E-mail: gundagay@notes.udayton.edu Dr. Aparna Higgins E-mail: Aparna.Higgins@notes.udayton.edu University of Dayton Dayton, OH 45469 Submitted January 25 th, 2004
More informationSome Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks
Some Approximation Algorithms for Constructing Combinatorial Structures Fixed in Networks Jianping Li Email: jianping@ynu.edu.cn Department of Mathematics Yunnan University, P.R. China 11 / 31 8 ¹ 1 3
More informationAssignment 4 Solutions of graph problems
Assignment 4 Solutions of graph problems 1. Let us assume that G is not a cycle. Consider the maximal path in the graph. Let the end points of the path be denoted as v 1, v k respectively. If either of
More informationMatching Algorithms. Proof. If a bipartite graph has a perfect matching, then it is easy to see that the right hand side is a necessary condition.
18.433 Combinatorial Optimization Matching Algorithms September 9,14,16 Lecturer: Santosh Vempala Given a graph G = (V, E), a matching M is a set of edges with the property that no two of the edges have
More informationComplexity Results on Graphs with Few Cliques
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 9, 2007, 127 136 Complexity Results on Graphs with Few Cliques Bill Rosgen 1 and Lorna Stewart 2 1 Institute for Quantum Computing and School
More informationMulticasting in the Hypercube, Chord and Binomial Graphs
Multicasting in the Hypercube, Chord and Binomial Graphs Christopher C. Cipriano and Teofilo F. Gonzalez Department of Computer Science University of California, Santa Barbara, CA, 93106 E-mail: {ccc,teo}@cs.ucsb.edu
More informationCanonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics
Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics M. Brazil D.A. Thomas J.F. Weng M. Zachariasen December 13, 2002 Abstract We present some fundamental structural properties
More informationThe NP-Completeness of Some Edge-Partition Problems
The NP-Completeness of Some Edge-Partition Problems Ian Holyer y SIAM J. COMPUT, Vol. 10, No. 4, November 1981 (pp. 713-717) c1981 Society for Industrial and Applied Mathematics 0097-5397/81/1004-0006
More informationAn Upper Bound on Stick Numbers for Links
An Upper Bound on Stick Numbers for Links Erik Insko August 24, 2005 Abstract We employ a supercoiling tangle construction to economically construct any pieceweise linear integral tangle containing seven
More informationThe problem of minimizing the elimination tree height for general graphs is N P-hard. However, there exist classes of graphs for which the problem can
A Simple Cubic Algorithm for Computing Minimum Height Elimination Trees for Interval Graphs Bengt Aspvall, Pinar Heggernes, Jan Arne Telle Department of Informatics, University of Bergen N{5020 Bergen,
More informationON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM
ON THE COMPLEXITY OF THE BROADCAST SCHEDULING PROBLEM SERGIY I. BUTENKO, CLAYTON W. COMMANDER, AND PANOS M. PARDALOS Abstract. In this paper, a Broadcast Scheduling Problem (bsp) in a time division multiple
More informationA Linear Time Algorithm for the Minimum Spanning Tree Problem. on a Planar Graph. Tomomi MATSUI. (January 1994 )
A Linear Time Algorithm for the Minimum Spanning Tree Problem on a Planar Graph Tomomi MATSUI (January 994 ) Department of Mathematical Engineering and Information Physics Faculty of Engineering, University
More informationPebble Sets in Convex Polygons
2 1 Pebble Sets in Convex Polygons Kevin Iga, Randall Maddox June 15, 2005 Abstract Lukács and András posed the problem of showing the existence of a set of n 2 points in the interior of a convex n-gon
More informationDiscrete Applied Mathematics. A revision and extension of results on 4-regular, 4-connected, claw-free graphs
Discrete Applied Mathematics 159 (2011) 1225 1230 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam A revision and extension of results
More informationMulticast Network Coded Flow in Grid Graphs
Multicast Network Coded Flow in Grid Graphs John Gormley and Eric Manley Department of Mathematics and Computer Science Drake University Des Moines, IA 50311 March 9, 014 Abstract Network coding, a relatively
More informationCSE331 Introduction to Algorithms Lecture 15 Minimum Spanning Trees
CSE1 Introduction to Algorithms Lecture 1 Minimum Spanning Trees Antoine Vigneron antoine@unist.ac.kr Ulsan National Institute of Science and Technology July 11, 201 Antoine Vigneron (UNIST) CSE1 Lecture
More informationMinimum Rectilinear Steiner Tree of n Points in the Unit Square
Minimum Rectilinear Steiner Tree of n Points in the Unit Square Adrian Dumitrescu Minghui Jiang October 16, 015 Abstract Chung and Graham conjectured (in 1981) that n points in the unit square [0,1] can
More informationThree Evolutionary Codings of Rectilinear Steiner Arborescences
Three Evolutionary Codings of Rectilinear Steiner Arborescences Bryant A. Julstrom 1 and Athos Antoniades 2 1 St. Cloud State University, St. Cloud, MN 56301 USA julstrom@eeyore.stcloudstate.edu 2 University
More information[8] that this cannot happen on the projective plane (cf. also [2]) and the results of Robertson, Seymour, and Thomas [5] on linkless embeddings of gra
Apex graphs with embeddings of face-width three Bojan Mohar Department of Mathematics University of Ljubljana Jadranska 19, 61111 Ljubljana Slovenia bojan.mohar@uni-lj.si Abstract Aa apex graph is a graph
More information22 Elementary Graph Algorithms. There are two standard ways to represent a
VI Graph Algorithms Elementary Graph Algorithms Minimum Spanning Trees Single-Source Shortest Paths All-Pairs Shortest Paths 22 Elementary Graph Algorithms There are two standard ways to represent a graph
More informationThe strong chromatic number of a graph
The strong chromatic number of a graph Noga Alon Abstract It is shown that there is an absolute constant c with the following property: For any two graphs G 1 = (V, E 1 ) and G 2 = (V, E 2 ) on the same
More informationApproximability Results for the p-center Problem
Approximability Results for the p-center Problem Stefan Buettcher Course Project Algorithm Design and Analysis Prof. Timothy Chan University of Waterloo, Spring 2004 The p-center
More informationEulerian disjoint paths problem in grid graphs is NP-complete
Discrete Applied Mathematics 143 (2004) 336 341 Notes Eulerian disjoint paths problem in grid graphs is NP-complete Daniel Marx www.elsevier.com/locate/dam Department of Computer Science and Information
More informationLower Bounds for Insertion Methods for TSP. Yossi Azar. Abstract. optimal tour. The lower bound holds even in the Euclidean Plane.
Lower Bounds for Insertion Methods for TSP Yossi Azar Abstract We show that the random insertion method for the traveling salesman problem (TSP) may produce a tour (log log n= log log log n) times longer
More informationA note on the subgraphs of the (2 )-grid
A note on the subgraphs of the (2 )-grid Josep Díaz a,2,1 a Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya Campus Nord, Edifici Ω, c/ Jordi Girona Salgado 1-3,
More informationAgreedy approximation for minimum connected dominating sets
Theoretical Computer Science 329 2004) 325 330 www.elsevier.com/locate/tcs Note Agreedy approximation for minimum connected dominating sets Lu Ruan a, Hongwei Du b, Xiaohua Jia b,,1, Weili Wu c,1,2, Yingshu
More informationAlgorithms: Lecture 10. Chalmers University of Technology
Algorithms: Lecture 10 Chalmers University of Technology Today s Topics Basic Definitions Path, Cycle, Tree, Connectivity, etc. Graph Traversal Depth First Search Breadth First Search Testing Bipartatiness
More informationConstructions of hamiltonian graphs with bounded degree and diameter O(log n)
Constructions of hamiltonian graphs with bounded degree and diameter O(log n) Aleksandar Ilić Faculty of Sciences and Mathematics, University of Niš, Serbia e-mail: aleksandari@gmail.com Dragan Stevanović
More informationThe Full Survey on The Euclidean Steiner Tree Problem
The Full Survey on The Euclidean Steiner Tree Problem Shikun Liu Abstract The Steiner Tree Problem is a famous and long-studied problem in combinatorial optimization. However, the best heuristics algorithm
More informationFundamental Properties of Graphs
Chapter three In many real-life situations we need to know how robust a graph that represents a certain network is, how edges or vertices can be removed without completely destroying the overall connectivity,
More informationTreewidth and graph minors
Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under
More informationA Polynomial Time Approximation Scheme for the problem of Interconnecting Highways. Technical Report
A Polynomial Time Approximation Scheme for the problem of Interconnecting Highways Technical Report Department of Computer Science and Engineering University of Minnesota 4-192 EECS Building 200 Union
More informationEnumeration of Full Graphs: Onset of the Asymptotic Region. Department of Mathematics. Massachusetts Institute of Technology. Cambridge, MA 02139
Enumeration of Full Graphs: Onset of the Asymptotic Region L. J. Cowen D. J. Kleitman y F. Lasaga D. E. Sussman Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Abstract
More informationK 4 C 5. Figure 4.5: Some well known family of graphs
08 CHAPTER. TOPICS IN CLASSICAL GRAPH THEORY K, K K K, K K, K K, K C C C C 6 6 P P P P P. Graph Operations Figure.: Some well known family of graphs A graph Y = (V,E ) is said to be a subgraph of a graph
More informationMatching Theory. Figure 1: Is this graph bipartite?
Matching Theory 1 Introduction A matching M of a graph is a subset of E such that no two edges in M share a vertex; edges which have this property are called independent edges. A matching M is said to
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationWe assume uniform hashing (UH):
We assume uniform hashing (UH): the probe sequence of each key is equally likely to be any of the! permutations of 0,1,, 1 UH generalizes the notion of SUH that produces not just a single number, but a
More informationOn the Complexity of Broadcast Scheduling. Problem
On the Complexity of Broadcast Scheduling Problem Sergiy Butenko, Clayton Commander and Panos Pardalos Abstract In this paper, a broadcast scheduling problem (BSP) in a time division multiple access (TDMA)
More informationA Simplied NP-complete MAXSAT Problem. Abstract. It is shown that the MAX2SAT problem is NP-complete even if every variable
A Simplied NP-complete MAXSAT Problem Venkatesh Raman 1, B. Ravikumar 2 and S. Srinivasa Rao 1 1 The Institute of Mathematical Sciences, C. I. T. Campus, Chennai 600 113. India 2 Department of Computer
More informationBus Matrix Synthesis Based On Steiner Graphs For Power Efficient System On Chip Communications
Bus Matrix Synthesis Based On Steiner Graphs For Power Efficient System On Chip Communications M.Jasmin Assistant Professor, Department of ECE, Bharath University Chennai 600073, India ABSTRACT: Power
More information1 Introduction The concept of graph spanners has been studied in several recent papers in the context of communication networks, distributed computing
On the Hardness of Approximating Spanners Guy Kortsarz June 1, 1999 Abstract A k spanner of a connected graph G = (V; E) is a subgraph G 0 consisting of all the vertices of V and a subset of the edges,
More informationMath236 Discrete Maths with Applications
Math236 Discrete Maths with Applications P. Ittmann UKZN, Pietermaritzburg Semester 1, 2012 Ittmann (UKZN PMB) Math236 2012 1 / 19 Degree Sequences Let G be a graph with vertex set V (G) = {v 1, v 2, v
More informationModule 6 NP-Complete Problems and Heuristics
Module 6 NP-Complete Problems and Heuristics Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu P, NP-Problems Class
More informationEfficient Multilayer Routing Based on Obstacle-Avoiding Preferred Direction Steiner Tree
Efficient Multilayer Routing Based on Obstacle-Avoiding Preferred Direction Steiner Tree Ching-Hung Liu, Yao-Hsin Chou, Shin-Yi Yuan, and Sy-Yen Kuo National Taiwan University 1 Outline 2 Outline 3 The
More informationRearrangement of DNA fragments: a branch-and-cut algorithm Abstract. In this paper we consider a problem that arises in the process of reconstruction
Rearrangement of DNA fragments: a branch-and-cut algorithm 1 C. E. Ferreira 1 C. C. de Souza 2 Y. Wakabayashi 1 1 Instituto de Mat. e Estatstica 2 Instituto de Computac~ao Universidade de S~ao Paulo e-mail:
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 2016-2017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.2. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations,
More informationMax-Cut and Max-Bisection are NP-hard on unit disk graphs
R u t c o r Research R e p o r t Max-Cut and Max-Bisection are NP-hard on unit disk graphs Josep Díaz a Marcin Kamiński b RRR 2006-23, September 2006 RUTCOR Rutgers Center for Operations Research Rutgers
More informationLecture 3: Graphs and flows
Chapter 3 Lecture 3: Graphs and flows Graphs: a useful combinatorial structure. Definitions: graph, directed and undirected graph, edge as ordered pair, path, cycle, connected graph, strongly connected
More informationA Novel Performance-Driven Topology Design Algorithm
A Novel Performance-Driven Topology Design Algorithm Min Pan, Chris Chu Priyadarshan Patra Electrical and Computer Engineering Dept. Intel Corporation Iowa State University, Ames, IA 50011 Hillsboro, OR
More informationG G[S] G[D]
Edge colouring reduced indierence graphs Celina M. H. de Figueiredo y Celia Picinin de Mello z Jo~ao Meidanis z Carmen Ortiz x Abstract The chromatic index problem { nding the minimum number of colours
More informationNumber Theory and Graph Theory
1 Number Theory and Graph Theory Chapter 6 Basic concepts and definitions of graph theory By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com
More informationSTEINER TREE CONSTRUCTIONS IN HYPERBOLIC SPACE
STEINER TREE CONSTRUCTIONS IN HYPERBOLIC SPACE DENISE HALVERSON AND DON MARCH Abstract. Methods for the construction of Steiner minimal trees for n fixed points in the hyperbolic plane are developed. A
More informationProcess Allocation for Load Distribution in Fault-Tolerant. Jong Kim*, Heejo Lee*, and Sunggu Lee** *Dept. of Computer Science and Engineering
Process Allocation for Load Distribution in Fault-Tolerant Multicomputers y Jong Kim*, Heejo Lee*, and Sunggu Lee** *Dept. of Computer Science and Engineering **Dept. of Electrical Engineering Pohang University
More informationa Steiner tree for S if S V(T) holds. For convenience, although T is not a rooted tree, we call each degree-1 vertex of T a leaf of T. We say that a l
Reachability between Steiner Trees in a Graph Haruka Mizuta 1,2,a) Takehiro Ito 1,3,b) Xiao Zhou 1,c) Abstract: In this paper, we study the reachability between Steiner trees in a graph: Given two Steiner
More informationOn-line Steiner Trees in the Euclidean Plane
On-line Steiner Trees in the Euclidean Plane Noga Alon Yossi Azar Abstract Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph
More informationGeometric Red-Blue Set Cover for Unit Squares and Related Problems
Geometric Red-Blue Set Cover for Unit Squares and Related Problems Timothy M. Chan Nan Hu Abstract We study a geometric version of the Red-Blue Set Cover problem originally proposed by Carr, Doddi, Konjevod,
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) We will be interested in s.t. ( )~1. To gain some intuition note ( )
The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More informationMinimal Steiner Trees for Rectangular Arrays of Lattice Points*
journal of combinatorial theory, Series A 79, 181208 (1997) article no. TA962751 Minimal Steiner Trees for Rectangular Arrays of Lattice Points* M. Brazil Department of Electrical Engineering, University
More information2017 SOLUTIONS (PRELIMINARY VERSION)
SIMON MARAIS MATHEMATICS COMPETITION 07 SOLUTIONS (PRELIMINARY VERSION) This document will be updated to include alternative solutions provided by contestants, after the competition has been mared. Problem
More informationApproximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks
Approximating Fault-Tolerant Steiner Subgraphs in Heterogeneous Wireless Networks Ambreen Shahnaz and Thomas Erlebach Department of Computer Science University of Leicester University Road, Leicester LE1
More informationLecture 1. 1 Notation
Lecture 1 (The material on mathematical logic is covered in the textbook starting with Chapter 5; however, for the first few lectures, I will be providing some required background topics and will not be
More informationCSE 421 Applications of DFS(?) Topological sort
CSE 421 Applications of DFS(?) Topological sort Yin Tat Lee 1 Precedence Constraints In a directed graph, an edge (i, j) means task i must occur before task j. Applications Course prerequisite: course
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More information22 Elementary Graph Algorithms. There are two standard ways to represent a
VI Graph Algorithms Elementary Graph Algorithms Minimum Spanning Trees Single-Source Shortest Paths All-Pairs Shortest Paths 22 Elementary Graph Algorithms There are two standard ways to represent a graph
More information1 Matchings in Graphs
Matchings in Graphs J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 J J 2 J 3 J 4 J 5 J J J 6 8 7 C C 2 C 3 C 4 C 5 C C 7 C 8 6 Definition Two edges are called independent if they are not adjacent
More information(i,j,k) North. Back (0,0,0) West (0,0,0) 01. East. Z Front. South. (a) (b)
A Simple Fault-Tolerant Adaptive and Minimal Routing Approach in 3-D Meshes y Jie Wu Department of Computer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 Abstract In this paper
More informationThe clique number of a random graph in (,1 2) Let ( ) # -subgraphs in = 2 =: ( ) 2 ( ) ( )
1 The clique number of a random graph in (,1 2) Let () # -subgraphs in = 2 =:() We will be interested in s.t. ()~1. To gain some intuition note ()~ 2 =2 and so ~2log. Now let us work rigorously. () (+1)
More information.Math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in .
0.1 More on innity.math 0450 Honors intro to analysis Spring, 2009 Notes #4 corrected (as of Monday evening, 1/12) some changes on page 6, as in email. 0.1.1 If you haven't read 1.3, do so now! In notes#1
More informationDefinition: A graph G = (V, E) is called a tree if G is connected and acyclic. The following theorem captures many important facts about trees.
Tree 1. Trees and their Properties. Spanning trees 3. Minimum Spanning Trees 4. Applications of Minimum Spanning Trees 5. Minimum Spanning Tree Algorithms 1.1 Properties of Trees: Definition: A graph G
More informationConstructing Connected Dominating Sets with Bounded Diameters in Wireless Networks
Constructing Connected Dominating Sets with Bounded Diameters in Wireless Networks Yingshu Li Department of Computer Science Georgia State University Atlanta, GA 30303 yli@cs.gsu.edu Donghyun Kim Feng
More informationTime complexity of two disjoint simple paths
Scientia Iranica D (2017) 24(3), 1335{1343 Sharif University of Technology Scientia Iranica Transactions D: Computer Science & Engineering and Electrical Engineering www.scientiairanica.com Research Note
More informationChapter 8. Voronoi Diagrams. 8.1 Post Oce Problem
Chapter 8 Voronoi Diagrams 8.1 Post Oce Problem Suppose there are n post oces p 1,... p n in a city. Someone who is located at a position q within the city would like to know which post oce is closest
More informationUnit 7: Maze (Area) and Global Routing
Unit 7: Maze (Area) and Global Routing Course contents Routing basics Maze (area) routing Global routing Readings Chapters 9.1, 9.2, 9.5 Filling Unit 7 1 Routing Unit 7 2 Routing Constraints 100% routing
More informationOn the Complexity of the Policy Improvement Algorithm. for Markov Decision Processes
On the Complexity of the Policy Improvement Algorithm for Markov Decision Processes Mary Melekopoglou Anne Condon Computer Sciences Department University of Wisconsin - Madison 0 West Dayton Street Madison,
More information16 Greedy Algorithms
16 Greedy Algorithms Optimization algorithms typically go through a sequence of steps, with a set of choices at each For many optimization problems, using dynamic programming to determine the best choices
More informationThe crossing number of K 1,4,n
Discrete Mathematics 308 (2008) 1634 1638 www.elsevier.com/locate/disc The crossing number of K 1,4,n Yuanqiu Huang, Tinglei Zhao Department of Mathematics, Normal University of Hunan, Changsha 410081,
More informationSimplicial Cells in Arrangements of Hyperplanes
Simplicial Cells in Arrangements of Hyperplanes Christoph Dätwyler 05.01.2013 This paper is a report written due to the authors presentation of a paper written by Shannon [1] in 1977. The presentation
More informationAn Eternal Domination Problem in Grids
Theory and Applications of Graphs Volume Issue 1 Article 2 2017 An Eternal Domination Problem in Grids William Klostermeyer University of North Florida, klostermeyer@hotmail.com Margaret-Ellen Messinger
More informationDecreasing the Diameter of Bounded Degree Graphs
Decreasing the Diameter of Bounded Degree Graphs Noga Alon András Gyárfás Miklós Ruszinkó February, 00 To the memory of Paul Erdős Abstract Let f d (G) denote the minimum number of edges that have to be
More informationV1.0: Seth Gilbert, V1.1: Steven Halim August 30, Abstract. d(e), and we assume that the distance function is non-negative (i.e., d(x, y) 0).
CS4234: Optimisation Algorithms Lecture 4 TRAVELLING-SALESMAN-PROBLEM (4 variants) V1.0: Seth Gilbert, V1.1: Steven Halim August 30, 2016 Abstract The goal of the TRAVELLING-SALESMAN-PROBLEM is to find
More informationSublinear-Time Parallel Algorithms. for Matching and Related Problems. Andrew V. Goldberg y. Stanford University. Stanford, CA 94305
Sublinear-Time Parallel Algorithms for Matching and Related Problems Andrew V. Goldberg y Department of Computer Science Stanford University Stanford, CA 94305 Serge A. Plotkin z Department of Computer
More informationInfinite locally random graphs
Infinite locally random graphs Pierre Charbit and Alex D. Scott Abstract Motivated by copying models of the web graph, Bonato and Janssen [3] introduced the following simple construction: given a graph
More information