Polyhedral Covers of Tree Space

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polyhedral Covers of Tree Space

The phylogenetic tree space, introduced by Billera, Holmes, and Vogtmann, is a cone over a simplicial complex. In this short article, we construct this complex from local gluings of classical polytopes, the associahedron and the permutohedron. Its homotopy is also reinterpreted and calculated based on polytope data.

متن کامل

Min-max tree covers of graphs

We provide constant factor approximation algorithms for covering the nodes of a graph using trees (rooted or unrooted), under the objective function of minimizing the weight of the maximum weight tree, subject to an upper bound on the number of trees used. These problems are related to location routing and traveling salesperson problems.

متن کامل

Using a Binary Space Partitioning Tree for Reconstructing Polyhedral Building Models from Airborne Lidar Data

During the past several years, point density covering topographic objects with airborne lidar (Light Detection And Ranging) technology has been greatly improved. This achievement provides an improved ability for reconstructing more complicated building roof structures; more specifically, those comprising various model primitives horizontally and/or vertically. However, the technology for automa...

متن کامل

Approximating the Tree and Tour Covers of a Graph

The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namel...

متن کامل

Rees algebras and polyhedral cones of ideals of vertex covers of perfect graphs

Let J be the ideal of vertex covers of a graph G. We give a graph theoretical characterization of the minimal generators of the symbolic Rees algebra of J . If G is perfect, it is shown that the Rees algebra of J is normal and we compute the irreducible representation of the Rees cone of J in terms of cliques. Then we prove that if G is perfect and unmixed, then the Rees algebra of J is a Goren...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2014

ISSN: 0895-4801,1095-7146

DOI: 10.1137/130947532