Alain Hertz 1 and Sacha Varone 2. Introduction A NOTE ON TREE REALIZATIONS OF MATRICES. RAIRO Operations Research Will be set by the publisher
|
|
- Magdalen Goodwin
- 5 years ago
- Views:
Transcription
1 RAIRO Operations Research Will be set by the publisher A NOTE ON TREE REALIZATIONS OF MATRICES Alain Hertz and Sacha Varone 2 Abstract It is well known that each tree metric M has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of M We extend this result to the class of symmetric matrices M with zero diagonal, positive entries, and such that m ij + m kl max{m ik + m, m il + m } for all distinct i, j, k, l Keywords: matrices, tree metrics, -point condition Mathematics Subject Classification 05C50,05B20,68R0,68U99 Introduction An n n matrix M = (m ij ) with zero diagonal is a tree metric if it satisfies the followng -point condition: m ij + m kl max{m ik + m,m il + m } i,j,k,l in {,,n} The -point condition entails the triangle inequality (for k = l) and symmetry (for i = k and j = l) There is an extensive literature on tree metrics; see for example [,6 9] It is well known that a tree metric M = (m ij ) can be represented by an unrooted tree T such that {,,n} is a subset of the vertex set of T, and the length of the unique chain connecting two vertices i and j in T ( i < j n) is equal to m ij March 2005 This wo has been partially funded by grant PA / from the Swiss National Science Foundation, received by the second author Département de mathématiques et de génie industriel, École Polytechnique, Montréal, Canada, alainhertz@geradca 2 LARIM, Département de génie informatique, École Polytechnique, Montréal, Canada, sachavarone@polymtlca c EDP Sciences 200
2 2 TITLE WILL BE SET BY THE PUBLISHER Let G = (V,E,d) be the graph with vertex set V, edge set E, and where d is a function assigning a positive length d ij to each edge (i,j) of G The length of the shortest chain between two vertices i and j in G is denoted d G ij Definition 0 Let M be a symmetric n n matrix with zero diagonal and such that 0 m ij m ik + m kj for all i,j,k in {,,n} A graph G = (V,E,d) is a realization of M = (m ij ) if and only if {,,n} is a subset of V, and d G ij = m ij for all i,j in {,,n} As mentioned above, tree metrics have a realization as a tree A realization G of a matrix M is said optimal if the total length of the edges in G is minimal among all realizations of M Hakimi and Yau [6] have proved that tree metrics have a unique realization as a tree, and this realization is optimal We propose to extend the above definition to matrices whose entries do not necessarily satisfy the triangle inequality Given a symmetric n n matrix M = (m ij ) with zero diagonal and positive entries, let K M denote the complete graph on n vertices in which each edge (i,j) has length m ij Definition 02 Let M be a symmetric n n matrix with zero diagonal and positive entries A graph G = (V,E,d) is a realization of M = (m ij ) if and only if {,,n} is a subset of V, and d G ij = dkm ij for all i,j in {,,n} Obviously, if M satisfies the triangle inequality, then d KM ij = m ij, and Definition 02 is then equivalent to Definition 0 Figure illustrates this new definition Notice that the matrix in Figure is not a tree metric, while it has a realization as a tree A matrix M Its associated complete graph K M A realization of M as a tree 5 Figure a tree realization of a tree metric Let M n denote the set of symmetric n n matrices M = (m ij ) with zero diagonal, positive entries, and such that m ij + m kl max{m ik + m,m il + m } for all distinct points i,j,k,l in {,,n} Since we only impose the -point condition on distinct points i,j,k,l, the entries of a matrix in M n do not necessarily satisfy the triangle inequality While all tree metrics belong to M n, the example in Figure 2 shows that a matrix having a realization as a tree does not necessarily belong to M n However, we prove in this
3 TITLE WILL BE SET BY THE PUBLISHER paper that all matrices in M n have a unique realization as a tree, and that this realization is optimal A matrix M that does not belong to M 2 Its associated complete graph K M 2 A realization of M as a tree Figure 2 a tree realization of a matrix that does not belong to M n The main result Let M = (m ij ) be any matrix in M n, and consider the matrix M = (m ij ) obtained from M by setting m ij equal to the length dkm ij of the shortest chain between i and j in K M Notice that the elements in M satisfy the triangle inequality In order to prove that M has a realization as a tree, it is sufficient to prove that M is a tree metric The proof is based on Floyd s algorithm [5] for the computation of M Floyd s algorithm [5] Set M 0 equal to M; For r := to n do For all i and j in {,,n} do Set m r ij equal to min{mr ij,m r ir + m r }; Set M equal to M n ; We shall prove that each matrix M r ( r n) is in M n Since the entries of M = M n satisfy the triangle inequality, we will be able to conclude that M is a tree metric Theorem Let M = (m ij ) be a matrix in M n, and let M = (m ij ) be the n n matrix obtained from M by setting m ij = dkm ij for all i and j in {,,n} Then M is a tree metric Proof Following Floyd s algorithm, define M 0 = M and let M r be the matrix obtained from M r by setting m r ij = min{mr ij,m r ir + m r } for all i and j in {,,n} Given four distinct points i,j,k,l in {,,n}, we denote s r il = m r ij + mr kl We prove by induction that each Mr (r =,,n) is in M n By hypothesis, M 0 = M is in M n, so assume M r M n It is sufficient to show that s r il max{sr ik,sr il } for all distinct i,j,k,l in {,,n}, or equivalently,
4 TITLE WILL BE SET BY THE PUBLISHER that two of the three sums s r il,sr ik and sr il are equal and not less than the third Notice that m r ri = mr ri and m r ij mr ij for all i j n Consider any four distinct points i,j,k and l Since r is possibly one of these four points, we divide the proof into two cases Case A : r {i,j,k,l}, say r = l Since M r M n, we may assume, without loss of generality (wlog) that s r ri sr ik = sr ij If mr ik = mr ik and m r ij = m r ij, then s r ri sr ik = sr ij and we are done So, we can assume wlog mr ik < m r ik It then follows that mr ri + s r ik = mr ri + s r ij < mr ik + m r ij, which means that m r ij = m r ri + m r < m r ij We therefore have s r ri mr ri + m r + m r = s r ik = sr ij Case B : r / {i,j,k,l} If s r il = sr il,sr ik = sr assume wlog that m r ij < mr ij m r = mr and m r = mr M n and s r ij < sr ij, while sr ik = sr Case A that s r ik = sr ri Hence, s r ik + sr ri = sr ik and sr il = sr il, there is nothing to prove So Notice that if m r ik = mr ik, mr il = mr il,, then we are done Indeed, since M r ik and sr ri = sr ri, we know from In a similar way, we also have sr il = s r ri ri + sr il, which means that sr ik = sr il Since M r M n,s r ik = sr ik,sr il = sr il and sr il < sr il we conclude that s r il < sr ik = sr il Wlog, we can therefore assume mr ik < mr ik The rest of the proof is divided into four subcases Case B : m r < m r + m r and m r > m r + m r Since s r = mr + m r + m r > s r s r = s r, which means that mr kl = m r s r il = sr ik Case B2 : m r Case B : m r < m r + m r We can assume m r kl = mr kl and m r, we know from Case A that + m r Hence, s r il < m r + m r, else we are in Case B, where the roles of points j and k are exchanged We can also assume m r il Indeed, if m r il m r ri +m r then s r il = mr ri < m r ri + m r +s r, sr ik = mr ri + s r, and sr il = mr ri + s r and we are done since Mr M n But now, s r ik > sr il, and we know from Case A that sr rikl = sr ik, which means that m r kl = mr +mr Hence, s r > sr, and we know + m r from Case A that s r = sr, which means that mr = mr We therefore have s r il < sr il = sr ik m r + m r We may assume m r and m r > m r + m r il m r ri + m r, else the situation is equivalent either to Case B or B2 (where the roles of points i and j are exchanged, as well as those of k and l) Hence, s r il sr ik = sr il
5 Case B : m r TITLE WILL BE SET BY THE PUBLISHER 5 m r + m r and m r m r Since M r M n, and s r ri < s r ij means that m r il < mr il If m r + m r we know that sr il = s r ij, which = m r +m r then s r il sr ik = sr il, which implies s r < sr We then know + m r Else, m r < m r + m r from Case A that s r = sr, which means that mr kl = mr We therefore have s r ik < sr il = sr il Corollary 2 Each matrix in M n has a unique realization as a tree, and this realization is optimal Proof Let M be any matrix in M n, and let M = (m ij ) be the n n matrix obtained from M by setting m ij = dkm ij for all i < j n It follows from Definition 02 that a graph is a realization of M if and only if it is a realization of M We know from the above theorem that M is a tree metric To conclude, it is sufficient to observe that each tree metric has a unique tree realization, and this realization is optimal 2 A related problem Given two n n tree metrics L = (l ij ) and U = (u ij ), the matrix sandwich problem [] is to find (if possible) a tree metric M = (m ij ) such that l ij m ij u ij for all i {,,n} Typically, the information concerning the distance matrix associated with a netwo may be inaccurate, an we are only given lower and upper bound matrices L and U We prove here below that a solution to the matrix sandwich problem can be obtained by first finding a matrix M M n that lies between L and U, and then constructing the tree metric M = (m ij ) with m ij = dkm ij Finding a matrix M M n that lies between L and U is possibly easier than finding a tree metric with the same lower and upper bound matrices, the reason being that the triangle inequality is not imposed on matrices in M n Proposition 2 Let M = (m ij ) be a matrix in M n, and let M = (m ij ) be the n n matrix obtained from M by setting m ij = dkm ij for all i and j in {,,n} If l ij m ij u ij for all i {,,n}, then M is a solution to the matrix sandwich problem Proof Let M = (m ij ) be a matrix in M n, such that l ij m ij u ij for all i {,,n} Since L and U are tree metrics, it follows that M has a zero diagonal and positive entries Let M = (m ij ) be the n n matrix obtained from M by setting m ij = dkm ij for all i < j n We know from Theorem that M is a tree metric Moreover, since L is a tree metric, we have l ij m ij m ij for all i,j {,,n}
6 6 TITLE WILL BE SET BY THE PUBLISHER References [] H-J Bandelt Recognition of tree metrics SIAM J on Algebraic Discrete Methods, (): 6, 990 [2] J-P Barthélémy and A Guénoche Trees and proximity representations John Wiley & Sons Ltd, Chichester, 99 [] P Buneman A note on metric properties of trees J Combin Theory Ser B, 7:8 50, 97 [] M Farach, S Kannan, and T Warnow A robust model for finding optimal evolutionary trees Algorithmica, :55 79, 995 [5] R W Floyd Algorithm 97 Shortest path Comm ACM, 5:5, 962 [6] S L Hakimi and S S Yau Distance matrix of a graph and its realizability Quart Appl Math, 22:05 7, 96 [7] A N Patrinos and S L Hakimi The distance matrix of a graph and its tree realization Quart Appl Math, 0: , 972 [8] J M S Simões-Pereira A note on the tree realizability of a distance matrix J Combin Theory, 6:0 0, 969 [9] S C Varone Trees related to realizations of distance matrices Discrete Mathematics, 92:7 6, 998
Alain Hertz 1 and Sacha Varone 2
RAIRO Operations Research RAIRO Oper Res (2007) 6 66 DOI: 005/ro:2007028 A NOTE ON TREE REALIZATIONS OF MATRICES Alain Hertz and Sacha Varone 2 Abstract It is well known that each tree metric M has a unique
More informationApplied Mathematics Letters
Applied Mathematics Letters 23 (2010) 286 290 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml The number of spanning trees of a graph Jianxi
More informationEssays on Some Combinatorial Optimization Problems with Interval Data
Essays on Some Combinatorial Optimization Problems with Interval Data a thesis submitted to the department of industrial engineering and the institute of engineering and sciences of bilkent university
More informationIEOR E4004: Introduction to OR: Deterministic Models
IEOR E4004: Introduction to OR: Deterministic Models 1 Dynamic Programming Following is a summary of the problems we discussed in class. (We do not include the discussion on the container problem or the
More informationStrong Subgraph k-connectivity of Digraphs
Strong Subgraph k-connectivity of Digraphs Yuefang Sun joint work with Gregory Gutin, Anders Yeo, Xiaoyan Zhang yuefangsun2013@163.com Department of Mathematics Shaoxing University, China July 2018, Zhuhai
More informationAn Application of Ramsey Theorem to Stopping Games
An Application of Ramsey Theorem to Stopping Games Eran Shmaya, Eilon Solan and Nicolas Vieille July 24, 2001 Abstract We prove that every two-player non zero-sum deterministic stopping game with uniformly
More informationA relation on 132-avoiding permutation patterns
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,
More informationEquilibrium payoffs in finite games
Equilibrium payoffs in finite games Ehud Lehrer, Eilon Solan, Yannick Viossat To cite this version: Ehud Lehrer, Eilon Solan, Yannick Viossat. Equilibrium payoffs in finite games. Journal of Mathematical
More informationLattices and the Knaster-Tarski Theorem
Lattices and the Knaster-Tarski Theorem Deepak D Souza Department of Computer Science and Automation Indian Institute of Science, Bangalore. 8 August 27 Outline 1 Why study lattices 2 Partial Orders 3
More informationMAT 4250: Lecture 1 Eric Chung
1 MAT 4250: Lecture 1 Eric Chung 2Chapter 1: Impartial Combinatorial Games 3 Combinatorial games Combinatorial games are two-person games with perfect information and no chance moves, and with a win-or-lose
More informationCATEGORICAL SKEW LATTICES
CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most
More informationStructural Induction
Structural Induction Jason Filippou CMSC250 @ UMCP 07-05-2016 Jason Filippou (CMSC250 @ UMCP) Structural Induction 07-05-2016 1 / 26 Outline 1 Recursively defined structures 2 Proofs Binary Trees Jason
More informationAN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS*
526 AN ALGORITHM FOR FINDING SHORTEST ROUTES FROM ALL SOURCE NODES TO A GIVEN DESTINATION IN GENERAL NETWORKS* By JIN Y. YEN (University of California, Berkeley) Summary. This paper presents an algorithm
More informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Department of Computer Science, University of Toronto, shlomoh,szeider@cs.toronto.edu Abstract.
More informationCSE 21 Winter 2016 Homework 6 Due: Wednesday, May 11, 2016 at 11:59pm. Instructions
CSE 1 Winter 016 Homework 6 Due: Wednesday, May 11, 016 at 11:59pm Instructions Homework should be done in groups of one to three people. You are free to change group members at any time throughout the
More informationBINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES
Journal of Science and Arts Year 17, No. 1(38), pp. 69-80, 2017 ORIGINAL PAPER BINOMIAL TRANSFORMS OF QUADRAPELL SEQUENCES AND QUADRAPELL MATRIX SEQUENCES CAN KIZILATEŞ 1, NAIM TUGLU 2, BAYRAM ÇEKİM 2
More informationON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH
Discussiones Mathematicae Graph Theory 37 (2017) 623 632 doi:10.7151/dmgt.1941 ON THE MAXIMUM AND MINIMUM SIZES OF A GRAPH WITH GIVEN k-connectivity Yuefang Sun Department of Mathematics Shaoxing University
More informationThe Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales
The Probabilistic Method - Probabilistic Techniques Lecture 7: Martingales Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2015-2016 Sotiris Nikoletseas, Associate
More informationLecture l(x) 1. (1) x X
Lecture 14 Agenda for the lecture Kraft s inequality Shannon codes The relation H(X) L u (X) = L p (X) H(X) + 1 14.1 Kraft s inequality While the definition of prefix-free codes is intuitively clear, we
More informationQuadrant marked mesh patterns in 123-avoiding permutations
Quadrant marked mesh patterns in 23-avoiding permutations Dun Qiu Department of Mathematics University of California, San Diego La Jolla, CA 92093-02. USA duqiu@math.ucsd.edu Jeffrey Remmel Department
More informationSublinear Time Algorithms Oct 19, Lecture 1
0368.416701 Sublinear Time Algorithms Oct 19, 2009 Lecturer: Ronitt Rubinfeld Lecture 1 Scribe: Daniel Shahaf 1 Sublinear-time algorithms: motivation Twenty years ago, there was practically no investigation
More informationCollinear Triple Hypergraphs and the Finite Plane Kakeya Problem
Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem Joshua Cooper August 14, 006 Abstract We show that the problem of counting collinear points in a permutation (previously considered by the
More informationComputing Unsatisfiable k-sat Instances with Few Occurrences per Variable
Computing Unsatisfiable k-sat Instances with Few Occurrences per Variable Shlomo Hoory and Stefan Szeider Abstract (k, s)-sat is the propositional satisfiability problem restricted to instances where each
More informationYao s Minimax Principle
Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,
More informationPermutation Factorizations and Prime Parking Functions
Permutation Factorizations and Prime Parking Functions Amarpreet Rattan Department of Combinatorics and Optimization University of Waterloo Waterloo, ON, Canada N2L 3G1 arattan@math.uwaterloo.ca June 10,
More informationLecture 6. 1 Polynomial-time algorithms for the global min-cut problem
ORIE 633 Network Flows September 20, 2007 Lecturer: David P. Williamson Lecture 6 Scribe: Animashree Anandkumar 1 Polynomial-time algorithms for the global min-cut problem 1.1 The global min-cut problem
More informationAn Optimal Algorithm for Finding All the Jumps of a Monotone Step-Function. Stutistics Deportment, Tel Aoio Unioersitv, Tel Aoiu, Isrue169978
An Optimal Algorithm for Finding All the Jumps of a Monotone Step-Function REFAEL HASSIN AND NIMROD MEGIDDO* Stutistics Deportment, Tel Aoio Unioersitv, Tel Aoiu, Isrue169978 Received July 26, 1983 The
More informationNotes on the symmetric group
Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function
More informationCumulants and triangles in Erdős-Rényi random graphs
Cumulants and triangles in Erdős-Rényi random graphs Valentin Féray partially joint work with Pierre-Loïc Méliot (Orsay) and Ashkan Nighekbali (Zürich) Institut für Mathematik, Universität Zürich Probability
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationThe Binomial Theorem and Consequences
The Binomial Theorem and Consequences Juris Steprāns York University November 17, 2011 Fermat s Theorem Pierre de Fermat claimed the following theorem in 1640, but the first published proof (by Leonhard
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More informationThe Real Numbers. Here we show one way to explicitly construct the real numbers R. First we need a definition.
The Real Numbers Here we show one way to explicitly construct the real numbers R. First we need a definition. Definitions/Notation: A sequence of rational numbers is a funtion f : N Q. Rather than write
More informationVariations on a theme by Weetman
Variations on a theme by Weetman A.E. Brouwer Abstract We show for many strongly regular graphs, and for all Taylor graphs except the hexagon, that locally graphs have bounded diameter. 1 Locally graphs
More informationA Property Equivalent to n-permutability for Infinite Groups
Journal of Algebra 221, 570 578 (1999) Article ID jabr.1999.7996, available online at http://www.idealibrary.com on A Property Equivalent to n-permutability for Infinite Groups Alireza Abdollahi* and Aliakbar
More informationMaximum Contiguous Subsequences
Chapter 8 Maximum Contiguous Subsequences In this chapter, we consider a well-know problem and apply the algorithm-design techniques that we have learned thus far to this problem. While applying these
More informationSome Bounds for the Singular Values of Matrices
Applied Mathematical Sciences, Vol., 007, no. 49, 443-449 Some Bounds for the Singular Values of Matrices Ramazan Turkmen and Haci Civciv Department of Mathematics, Faculty of Art and Science Selcuk University,
More informationCONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS. 1. Introduction. Novi Sad J. Math. Vol. 35, No. 2, 2005,
Novi Sad J. Math. Vol. 35, No. 2, 2005, 155-160 CONSTRUCTION OF CODES BY LATTICE VALUED FUZZY SETS Mališa Žižović 1, Vera Lazarević 2 Abstract. To every finite lattice L, one can associate a binary blockcode,
More informationECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games
University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More informationOn the Lower Arbitrage Bound of American Contingent Claims
On the Lower Arbitrage Bound of American Contingent Claims Beatrice Acciaio Gregor Svindland December 2011 Abstract We prove that in a discrete-time market model the lower arbitrage bound of an American
More informationFractional Graphs. Figure 1
Fractional Graphs Richard H. Hammack Department of Mathematics and Applied Mathematics Virginia Commonwealth University Richmond, VA 23284-2014, USA rhammack@vcu.edu Abstract. Edge-colorings are used to
More informationOnline Shopping Intermediaries: The Strategic Design of Search Environments
Online Supplemental Appendix to Online Shopping Intermediaries: The Strategic Design of Search Environments Anthony Dukes University of Southern California Lin Liu University of Central Florida February
More informationCollective Profitability and Welfare in Selling-Buying Intermediation Processes
Collective Profitability and Welfare in Selling-Buying Intermediation Processes Amelia Bădică 1, Costin Bădică 1(B), Mirjana Ivanović 2, and Ionuţ Buligiu 1 1 University of Craiova, A. I. Cuza 13, 200530
More informationAnh Maciag. A Two-Person Bargaining Problem
Anh Maciag Saint Mary s College of California Department of Mathematics May 16, 2016 A Two-Person Bargaining Problem Supervisors: Professor Kathryn Porter Professor Michael Nathanson Professor Chris Jones
More informationCartesian Product of Two S-Valued Graphs
Global Journal of Mathematical Sciences: Theory and Practical. ISSN 0974-3200 Volume 9, Number 3 (2017), pp. 347-355 International Research Publication House http://www.irphouse.com Cartesian Product of
More informationSolutions of Bimatrix Coalitional Games
Applied Mathematical Sciences, Vol. 8, 2014, no. 169, 8435-8441 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.410880 Solutions of Bimatrix Coalitional Games Xeniya Grigorieva St.Petersburg
More informationHeap Building Bounds
Heap Building Bounds Zhentao Li 1 and Bruce A. Reed 2 1 School of Computer Science, McGill University zhentao.li@mail.mcgill.ca 2 School of Computer Science, McGill University breed@cs.mcgill.ca Abstract.
More informationUNIT 2. Greedy Method GENERAL METHOD
UNIT 2 GENERAL METHOD Greedy Method Greedy is the most straight forward design technique. Most of the problems have n inputs and require us to obtain a subset that satisfies some constraints. Any subset
More information6 -AL- ONE MACHINE SEQUENCING TO MINIMIZE MEAN FLOW TIME WITH MINIMUM NUMBER TARDY. Hamilton Emmons \,«* Technical Memorandum No. 2.
li. 1. 6 -AL- ONE MACHINE SEQUENCING TO MINIMIZE MEAN FLOW TIME WITH MINIMUM NUMBER TARDY f \,«* Hamilton Emmons Technical Memorandum No. 2 May, 1973 1 il 1 Abstract The problem of sequencing n jobs on
More informationA NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ
A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS Burhaneddin İZGİ Department of Mathematics, Istanbul Technical University, Istanbul, Turkey
More informationMSU CSE Spring 2011 Exam 2-ANSWERS
MSU CSE 260-001 Spring 2011 Exam 2-NSWERS Name: This is a closed book exam, with 9 problems on 5 pages totaling 100 points. Integer ivision/ Modulo rithmetic 1. We can add two numbers in base 2 by using
More informationAlgebra homework 8 Homomorphisms, isomorphisms
MATH-UA.343.005 T.A. Louis Guigo Algebra homework 8 Homomorphisms, isomorphisms For every n 1 we denote by S n the n-th symmetric group. Exercise 1. Consider the following permutations: ( ) ( 1 2 3 4 5
More informationCS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games
CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games Tim Roughgarden November 6, 013 1 Canonical POA Proofs In Lecture 1 we proved that the price of anarchy (POA)
More informationCourse Information and Introduction
August 20, 2015 Course Information 1 Instructor : Email : arash.rafiey@indstate.edu Office : Root Hall A-127 Office Hours : Tuesdays 12:00 pm to 1:00 pm in my office (A-127) 2 Course Webpage : http://cs.indstate.edu/
More informationStrategyproof Facility Location for Concave Cost Functions
Strategyproof Facility Location for Concave Cost Functions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationSingle Machine Inserted Idle Time Scheduling with Release Times and Due Dates
Single Machine Inserted Idle Time Scheduling with Release Times and Due Dates Natalia Grigoreva Department of Mathematics and Mechanics, St.Petersburg State University, Russia n.s.grig@gmail.com Abstract.
More informationGENERATION OF STANDARD NORMAL RANDOM NUMBERS. Naveen Kumar Boiroju and M. Krishna Reddy
GENERATION OF STANDARD NORMAL RANDOM NUMBERS Naveen Kumar Boiroju and M. Krishna Reddy Department of Statistics, Osmania University, Hyderabad- 500 007, INDIA Email: nanibyrozu@gmail.com, reddymk54@gmail.com
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More informationNOTES ON FIBONACCI TREES AND THEIR OPTIMALITY* YASUICHI HORIBE INTRODUCTION 1. FIBONACCI TREES
0#0# NOTES ON FIBONACCI TREES AND THEIR OPTIMALITY* YASUICHI HORIBE Shizuoka University, Hamamatsu, 432, Japan (Submitted February 1982) INTRODUCTION Continuing a previous paper [3], some new observations
More informationEpimorphisms and Ideals of Distributive Nearlattices
Annals of Pure and Applied Mathematics Vol. 18, No. 2, 2018,175-179 ISSN: 2279-087X (P), 2279-0888(online) Published on 9 November 2018 www.researchmathsci.org DOI: http://dx.doi.org/10.22457/apam.v18n2a5
More informationCrash-tolerant Consensus in Directed Graph Revisited
Crash-tolerant Consensus in Directed Graph Revisited Ashish Choudhury Gayathri Garimella Arpita Patra Divya Ravi Pratik Sarkar Abstract Fault-tolerant distributed consensus is a fundamental problem in
More informationBlackwell Optimality in Markov Decision Processes with Partial Observation
Blackwell Optimality in Markov Decision Processes with Partial Observation Dinah Rosenberg and Eilon Solan and Nicolas Vieille April 6, 2000 Abstract We prove the existence of Blackwell ε-optimal strategies
More informationThe Stackelberg Minimum Spanning Tree Game
The Stackelberg Minimum Spanning Tree Game J. Cardinal, E. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, O. Weimann, The Stackelberg Minimum Spanning Tree Game, WADS 07 Stackelberg Game 2 players:
More informationLecture 19: March 20
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 19: March 0 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationDecision Trees with Minimum Average Depth for Sorting Eight Elements
Decision Trees with Minimum Average Depth for Sorting Eight Elements Hassan AbouEisha, Igor Chikalov, Mikhail Moshkov Computer, Electrical and Mathematical Sciences and Engineering Division, King Abdullah
More informationINTERVAL DISMANTLABLE LATTICES
INTERVAL DISMANTLABLE LATTICES KIRA ADARICHEVA, JENNIFER HYNDMAN, STEFFEN LEMPP, AND J. B. NATION Abstract. A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter,
More informationTHE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE
THE TRAVELING SALESMAN PROBLEM FOR MOVING POINTS ON A LINE GÜNTER ROTE Abstract. A salesperson wants to visit each of n objects that move on a line at given constant speeds in the shortest possible time,
More informationOutline. 1 Introduction. 2 Algorithms. 3 Examples. Algorithm 1 General coordinate minimization framework. 1: Choose x 0 R n and set k 0.
Outline Coordinate Minimization Daniel P. Robinson Department of Applied Mathematics and Statistics Johns Hopkins University November 27, 208 Introduction 2 Algorithms Cyclic order with exact minimization
More informationOn the Distribution and Its Properties of the Sum of a Normal and a Doubly Truncated Normal
The Korean Communications in Statistics Vol. 13 No. 2, 2006, pp. 255-266 On the Distribution and Its Properties of the Sum of a Normal and a Doubly Truncated Normal Hea-Jung Kim 1) Abstract This paper
More informationFundamental Algorithms - Surprise Test
Technische Universität München Fakultät für Informatik Lehrstuhl für Effiziente Algorithmen Dmytro Chibisov Sandeep Sadanandan Winter Semester 007/08 Sheet Model Test January 16, 008 Fundamental Algorithms
More information6.231 DYNAMIC PROGRAMMING LECTURE 3 LECTURE OUTLINE
6.21 DYNAMIC PROGRAMMING LECTURE LECTURE OUTLINE Deterministic finite-state DP problems Backward shortest path algorithm Forward shortest path algorithm Shortest path examples Alternative shortest path
More informationPath Auction Games When an Agent Can Own Multiple Edges
Path Auction Games When an Agent Can Own Multiple Edges Ye Du Rahul Sami Yaoyun Shi Department of Electrical Engineering and Computer Science, University of Michigan 2260 Hayward Ave, Ann Arbor, MI 48109-2121,
More informationCHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n
CHARACTERIZATION OF CLOSED CONVEX SUBSETS OF R n Chebyshev Sets A subset S of a metric space X is said to be a Chebyshev set if, for every x 2 X; there is a unique point in S that is closest to x: Put
More informationTEST 1 SOLUTIONS MATH 1002
October 17, 2014 1 TEST 1 SOLUTIONS MATH 1002 1. Indicate whether each it below exists or does not exist. If the it exists then write what it is. No proofs are required. For example, 1 n exists and is
More informationHandout 4: Deterministic Systems and the Shortest Path Problem
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 4: Deterministic Systems and the Shortest Path Problem Instructor: Shiqian Ma January 27, 2014 Suggested Reading: Bertsekas
More informationRISK ADJUSTMENT FOR LOSS RESERVING BY A COST OF CAPITAL TECHNIQUE
RISK ADJUSTMENT FOR LOSS RESERVING BY A COST OF CAPITAL TECHNIQUE B. POSTHUMA 1, E.A. CATOR, V. LOUS, AND E.W. VAN ZWET Abstract. Primarily, Solvency II concerns the amount of capital that EU insurance
More informationOptimal Allocation of Policy Limits and Deductibles
Optimal Allocation of Policy Limits and Deductibles Ka Chun Cheung Email: kccheung@math.ucalgary.ca Tel: +1-403-2108697 Fax: +1-403-2825150 Department of Mathematics and Statistics, University of Calgary,
More informationOptimal Satisficing Tree Searches
Optimal Satisficing Tree Searches Dan Geiger and Jeffrey A. Barnett Northrop Research and Technology Center One Research Park Palos Verdes, CA 90274 Abstract We provide an algorithm that finds optimal
More informationOnline Algorithms SS 2013
Faculty of Computer Science, Electrical Engineering and Mathematics Algorithms and Complexity research group Jun.-Prof. Dr. Alexander Skopalik Online Algorithms SS 2013 Summary of the lecture by Vanessa
More informationMultistage risk-averse asset allocation with transaction costs
Multistage risk-averse asset allocation with transaction costs 1 Introduction Václav Kozmík 1 Abstract. This paper deals with asset allocation problems formulated as multistage stochastic programming models.
More informationA NOTE ON A SQUARE-ROOT RULE FOR REINSURANCE. Michael R. Powers and Martin Shubik. June 2005 COWLES FOUNDATION DISCUSSION PAPER NO.
A NOTE ON A SQUARE-ROOT RULE FOR REINSURANCE By Michael R. Powers and Martin Shubik June 2005 COWLES FOUNDATION DISCUSSION PAPER NO. 1521 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box
More information1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE
1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 51, NO 3, MARCH 2005 On Optimal Multilayer Cyclotomic Space Time Code Designs Genyuan Wang Xiang-Gen Xia, Senior Member, IEEE Abstract High rate large
More informationGeneral Equilibrium under Uncertainty
General Equilibrium under Uncertainty The Arrow-Debreu Model General Idea: this model is formally identical to the GE model commodities are interpreted as contingent commodities (commodities are contingent
More informationThe Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer. Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis
The Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer Xi Chen, George Matikas, Dimitris Paparas, Mihalis Yannakakis Seller has n items for sale The Set-up Seller has n items
More informationLecture 2: The Simple Story of 2-SAT
0510-7410: Topics in Algorithms - Random Satisfiability March 04, 2014 Lecture 2: The Simple Story of 2-SAT Lecturer: Benny Applebaum Scribe(s): Mor Baruch 1 Lecture Outline In this talk we will show that
More informationSecant Varieties, Symbolic Powers, Statistical Models
Secant Varieties, Symbolic Powers, Statistical Models Seth Sullivant North Carolina State University November 19, 2012 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, 2012 1 / 27 Joins and Secant
More informationMechanisms for House Allocation with Existing Tenants under Dichotomous Preferences
Mechanisms for House Allocation with Existing Tenants under Dichotomous Preferences Haris Aziz Data61 and UNSW, Sydney, Australia Phone: +61-294905909 Abstract We consider house allocation with existing
More informationOn the h-vector of a Lattice Path Matroid
On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:
More informationInvestigating First Returns: The Effect of Multicolored Vectors
Investigating First Returns: The Effect of Multicolored Vectors arxiv:1811.02707v1 [math.co] 7 Nov 2018 Shakuan Frankson and Myka Terry Mathematics Department SPIRAL Program at Morgan State University,
More informationNotes on Natural Logic
Notes on Natural Logic Notes for PHIL370 Eric Pacuit November 16, 2012 1 Preliminaries: Trees A tree is a structure T = (T, E), where T is a nonempty set whose elements are called nodes and E is a relation
More informationOptimal rebalancing of portfolios with transaction costs assuming constant risk aversion
Optimal rebalancing of portfolios with transaction costs assuming constant risk aversion Lars Holden PhD, Managing director t: +47 22852672 Norwegian Computing Center, P. O. Box 114 Blindern, NO 0314 Oslo,
More informationTug of War Game. William Gasarch and Nick Sovich and Paul Zimand. October 6, Abstract
Tug of War Game William Gasarch and ick Sovich and Paul Zimand October 6, 2009 To be written later Abstract Introduction Combinatorial games under auction play, introduced by Lazarus, Loeb, Propp, Stromquist,
More informationCHAPTER 14: REPEATED PRISONER S DILEMMA
CHAPTER 4: REPEATED PRISONER S DILEMMA In this chapter, we consider infinitely repeated play of the Prisoner s Dilemma game. We denote the possible actions for P i by C i for cooperating with the other
More informationLaurence Boxer and Ismet KARACA
THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.
More informationOn the Optimality of a Family of Binary Trees Techical Report TR
On the Optimality of a Family of Binary Trees Techical Report TR-011101-1 Dana Vrajitoru and William Knight Indiana University South Bend Department of Computer and Information Sciences Abstract In this
More informationLog-linear Dynamics and Local Potential
Log-linear Dynamics and Local Potential Daijiro Okada and Olivier Tercieux [This version: November 28, 2008] Abstract We show that local potential maximizer ([15]) with constant weights is stochastically
More informationTHE LYING ORACLE GAME WITH A BIASED COIN
Applied Probability Trust (13 July 2009 THE LYING ORACLE GAME WITH A BIASED COIN ROBB KOETHER, Hampden-Sydney College MARCUS PENDERGRASS, Hampden-Sydney College JOHN OSOINACH, Millsaps College Abstract
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationCopyright 1973, by the author(s). All rights reserved.
Copyright 1973, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are
More information