Filters








3,112 Hits in 4.9 sec

The node-depth encoding

Telma W. de Lima, Franz Rothlauf, Alexandre C.B. Delbem
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fdhfwmjdwjbvxo6zc7cdt5hi7q" style="color: black;">Proceedings of the 10th annual conference on Genetic and evolutionary computation - GECCO &#39;08</a> </i> &nbsp;
In comparison to other evolutionary algorithms for the bounded-diameter minimum spanning tree evolutionary algorithms using the node-depth encoding have a good performance.  ...  The performance of node-depth encoding is investigated for the bounded-diameter minimum spanning tree problem. The results are presented for Euclidean instances presented in the literature.  ...  ACKNOWLEDGMENTS The authors acknowledgments are to FAPESP by the research scholarship and the Department of Information System and Business Administration in the University of Mainz, where part of this  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1389095.1389279">doi:10.1145/1389095.1389279</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/gecco/LimaRD08.html">dblp:conf/gecco/LimaRD08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/h573m4ho7vb27axy4voev7nwhe">fatcat:h573m4ho7vb27axy4voev7nwhe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810163635/http://www.cs.bham.ac.uk/~wbl/biblio/gecco2008/docs/p969.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/73/e9/73e958c913f89cd20afae358d51fc49f7bc7e6d1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1389095.1389279"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Minimum Spanning Tree Based Clustering Algorithms

Oleksandr Grygorash, Yan Zhou, Zach Jorgensen
<span title="">2006</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/buicouggnjbqbckha3623cme6i" style="color: black;">Proceedings - International Conference on Tools with Artificial Intelligence, TAI</a> </i> &nbsp;
The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In this paper, we propose two minimum spanning tree based clustering algorithms.  ...  We also apply our algorithms to image color clustering and compare our algorithms to the standard minimum spanning tree clustering algorithm.  ...  A Euclidean minimum spanning tree (EMST) is a spanning tree of a set of n points in a metric space (E n ), where the length of an edge is the Euclidean distance between a pair of points in the point set  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ictai.2006.83">doi:10.1109/ictai.2006.83</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/ictai/GrygorashZJ06.html">dblp:conf/ictai/GrygorashZJ06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lpcrk2iknjdphlmgnwfo7dg34e">fatcat:lpcrk2iknjdphlmgnwfo7dg34e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810213234/https://static.aminer.org/pdf/PDF/000/219/731/computing_hierarchies_of_clusters_from_the_euclidean_minimum_spanning_tree.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/42/8d/428d9beef15632cbde512c38d7fa667d9e7a8d26.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/ictai.2006.83"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Approximation Algorithms for Minimizing Average Distortion

Kedar Dhamdhere, Anupam Gupta, R. Ravi
<span title="2005-11-29">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/qj6jzeossfhihfshwf7nb7lbcq" style="color: black;">Theory of Computing Systems</a> </i> &nbsp;
distance in the metric is stretched.  ...  Finally, when the average distortion is measured only over the endpoints of the edges of an input tree metric, we show how to exploit the structure of tree metrics to give an exact solution in polynomial  ...  Let = x,y∈V d(x, y) denote the sum of all the distances in the metric d, and hence av(d) = /n 2 is the average distance in d.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-005-1259-6">doi:10.1007/s00224-005-1259-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/477ackl7nrbbdesju6yhoz72pm">fatcat:477ackl7nrbbdesju6yhoz72pm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180205054537/http://www.contrib.andrew.cmu.edu:80/~ravi/tcs06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/21/79/2179c83bc922d31951e316ae8fb6551728b1abf1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00224-005-1259-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Minimum Spanning Tree-based Structural Similarity Clustering for Image Mining with Local Region Outliers

S. John Peter
<span title="2010-10-10">2010</span> <i title="Foundation of Computer Science"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/b637noqf3vhmhjevdfk3h5pdsu" style="color: black;">International Journal of Computer Applications</a> </i> &nbsp;
In this paper we propose a novel algorithm, Minimum Spanning Tree based Structural Similarity Clustering for Image Mining with Local Region Outliers (MSTSSCIMLRO) to segment the given image and to detect  ...  In MSTSSCIMLRO algorithm we use weighted Euclidean distance for edges, which is key element in building the graph from image.  ...  A Euclidean minimum spanning tree (EMST) is a spanning tree of a set of n points in a metric space (E n ), where the length of an edge is the Euclidean distance between a pair of points in the point set  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/1211-1737">doi:10.5120/1211-1737</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qqzdecgf2rgyraw6vs6gm4roji">fatcat:qqzdecgf2rgyraw6vs6gm4roji</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180601201945/https://www.ijcaonline.org/volume8/number6/pxc3871737.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0b/15/0b15dce108e06b929cc58e654108b1b8209862b4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5120/1211-1737"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 7612 of Mathematical Reviews Vol. , Issue 2000k [page]

<span title="">2000</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Summary: “The question whether every connected graph G has a spanning tree 7 of minimum average distance such that T is distance preserving from some vertex is answered in the negative.  ...  Moreover it is shown that, if such a tree exists, it is not necessarily distance preserving from a median vertex.” 2000k:05087 05C05 Deuber, W. A. (D-BLF-IM; Bielefeld) ; Kostochka, A. V.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_2000-11_2000k/page/7612" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_2000-11_2000k/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem

Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
<span title="">2001</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/o653fqsowvcyrhw6p4gdmpdkwm" style="color: black;">Mathematical programming</a> </i> &nbsp;
The capacitated miinimum spanning tree (CMST) problem is to find a minimum cost spanning tree with an additional cardinality constraint on the sizes of the subtrees incident to a given root node.  ...  In this paper, we generalize their neighborhood structures to allow exchanges of nodes among multiple subtrees sitmultaneously; we refer to such neighborhood structures as multi-exchanlge neighborhood  ...  Solving a minimum spanning tree over T[j] \ j} subtree takes O(K 2 ) time. Once this is done, we solve a minimum spanning tree over the node r[j].  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s101070100234">doi:10.1007/s101070100234</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mgr6upawpndarhi6jr5abl6t3q">fatcat:mgr6upawpndarhi6jr5abl6t3q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811085137/http://jorlin.scripts.mit.edu/docs/publications/74-multi-exchange%20neighb.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/57/3f/573f915656b828d6c0bb4beb2c867cce624c1779.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s101070100234"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

Olivier Elemento, Olivier Gascuel
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/usw2n4yaarcurchx7i4on2iqea" style="color: black;">Journal of Discrete Algorithms</a> </i> &nbsp;
In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees.  ...  This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree.  ...  It has been shown that the average distance between two non-intersecting subtrees X and Y is preserved between ∆ and ∆ T , when these subtrees are adjacent to a common ternary node (i.e., A and B, A and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jda.2004.08.013">doi:10.1016/j.jda.2004.08.013</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nimowqajtner3dspvehwt6ewuq">fatcat:nimowqajtner3dspvehwt6ewuq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706033752/https://hal-lirmm.ccsd.cnrs.fr/lirmm-00105291/document/" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/7c/927c7d30761aa00995a29af0e40710c270cf2e0a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.jda.2004.08.013"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees [chapter]

Olivier Elemento, Olivier Gascuel
<span title="">2003</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees.  ...  This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree.  ...  It has been shown that the average distance between two non-intersecting subtrees X and Y is preserved between ∆ and ∆ T , when these subtrees are adjacent to a common ternary node (i.e., A and B, A and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44888-8_8">doi:10.1007/3-540-44888-8_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kecfuxq5b5cqtiwzpindcua7qq">fatcat:kecfuxq5b5cqtiwzpindcua7qq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706033752/https://hal-lirmm.ccsd.cnrs.fr/lirmm-00105291/document/" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/92/7c/927c7d30761aa00995a29af0e40710c270cf2e0a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44888-8_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

CLUSTERING WITH MINIMUM SPANNING TREES

YAN ZHOU, OLEKSANDR GRYGORASH, THOMAS F. HAIN
<span title="">2011</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bmgus4fa7vg37kpnbuixwilqf4" style="color: black;">International journal on artificial intelligence tools</a> </i> &nbsp;
Our unconstrained clustering algorithm partitions a point set into a group of clusters by maximally reducing the overall standard deviation of the edges in the Euclidean minimum spanning tree constructed  ...  We propose two Euclidean minimum spanning tree based clustering algorithms -one a k-constrained, and the other an unconstrained algorithm.  ...  All distinct colors in a given image are used to construct a Euclidean minimum spanning tree in the RGB color space.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218213011000061">doi:10.1142/s0218213011000061</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ixmptsuozfaflotdfma7wlkf64">fatcat:ixmptsuozfaflotdfma7wlkf64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100626062725/http://www.cis.usouthal.edu/~hain/general/Publications/pr07.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/6d/bd6d3dd684009f66b98c1f0fad3e4c667da926ea.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218213011000061"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Fuzzy preserving virtual polar coordinate space sensor networks for mobility performance consideration

Wally Chen, Sy Yen Kuo, Han Chieh Chao
<span title="">2006</span> <i title="Inderscience Publishers"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/th5ndfa3ufbzpllha2q2jqwnoe" style="color: black;">International Journal of Sensor Networks (IJSNet)</a> </i> &nbsp;
This tree-like architecture is suitable for organising in sensor networks; however, it is a challenge to maintain the tree-like architecture, especially in sensor networks, each node can only provide limited  ...  In such a structure, efficient routing strategies for utilising cross-links are provided without additional information. The maintenance of tree structure in a mobile environment is considered.  ...  Fuzzy preserving engine Several policies were designed for preserving interspaces: • if the current node spans a large subtree, it should preserve more angle range • if the current node has a large angle  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijsnet.2006.012033">doi:10.1504/ijsnet.2006.012033</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xfytjtywfneyrl6qnx52on6v4a">fatcat:xfytjtywfneyrl6qnx52on6v4a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809110947/http://hcc.dormv6.niu.edu.tw/~hccftp/journal45.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/26/ee262856941a5ddf26667491b5a0c0bc96801027.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1504/ijsnet.2006.012033"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Permutation-based Recombination Operator to Node-depth Encoding

Telma Woerle de Lima, Alexandre Cláudio Botazzo Delbem, Roney Lopes Lima, Gustavo Post Sabin, Marcos Antônio Almeida de Oliveira
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cx3f4s3qmfe6bg4qvuy2cxezyu" style="color: black;">Procedia Computer Science</a> </i> &nbsp;
This problem consists in finding a spanning tree which minimizes the cost of transmitting a given set of communication requirements between n sites over the tree edges.  ...  An EA with the NDE and its new recombination operator NOX was applied to the optimal communication spanning tree problem (OCSTP).  ...  M ST is the distance between tree T i and the minimum spanning tree of the graph, and average minimum distance to stars d star−pop = 1 μ μ i=1 d i,ST AR .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2016.05.320">doi:10.1016/j.procs.2016.05.320</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/okfjbymybjcgxn7x63dsmmgmbe">fatcat:okfjbymybjcgxn7x63dsmmgmbe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190415015204/https://core.ac.uk/download/pdf/82233608.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/57/c957e6f8cb42b730f1a0bfb2ec5f00e3787a144b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.procs.2016.05.320"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> elsevier.com </button> </a>

Using trees to depict a forest

Bin Liu, H. V. Jagadish
<span title="2009-08-01">2009</span> <i title="VLDB Endowment"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6rqwwpkkjbcldejepcehaalby" style="color: black;">Proceedings of the VLDB Endowment</a> </i> &nbsp;
Experiments show that our algorithms outperform the stateof-the-art in both result quality and efficiency.  ...  An alternative approach to the first page is not to try to show the best results, but instead to help users learn what is available in the whole result set and direct them to finding what they need.  ...  Results are reported in Sec. 2, and show that k -medoid clustering with minimum average distance to be the technique of choice.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/1687627.1687643">doi:10.14778/1687627.1687643</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lqgtkfedvfecbe5z25ihuo4zce">fatcat:lqgtkfedvfecbe5z25ihuo4zce</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100615070042/http://www.eecs.umich.edu/~binliu/pub/vldb09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/69/1e6938108f562cfd5f5803034ec591f2644057c1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.14778/1687627.1687643"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Steiner Shallow-Light Trees Are Exponentially Lighter than Spanning Ones

Michael Elkin, Shay Solomon
<span title="">2015</span> <i title="Society for Industrial &amp; Applied Mathematics (SIAM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7dys7zoberdktmxyjciuy5bnse" style="color: black;">SIAM journal on computing (Print)</a> </i> &nbsp;
vertex rt ∈ V if (1) it approximates all distances from rt to the other vertices up to a factor of α, and (2) its weight is at most β times the weight of the minimum spanning tree MST (G) of G.  ...  For a pair of parameters α, β ≥ 1, a spanning tree T of a weighted undirected n-vertex graph G = (V, E, w) is called an (α, β)-shallow-light tree (shortly, (α, β)-SLT) of G with respect to a designated  ...  INTRODUCTION Main Results A minimum spanning tree (henceforth, MST) of a weighted undirected graph G = (V, E, w), w : E → R + , is a spanning tree T = (V, H, w) of G with minimum weight w(T ) = e∈H w  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/13094791x">doi:10.1137/13094791x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/y46klravtbacppzlmrcv4kjxcu">fatcat:y46klravtbacppzlmrcv4kjxcu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808040800/https://www.cs.bgu.ac.il/~shayso/Papers/FOCS11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/c5/96c5557611d21241fa633125caf278cb4db1223c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1137/13094791x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Steiner Shallow-Light Trees are Exponentially Lighter than Spanning Ones

Michael Elkin, Shay Solomon
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v4uclqixrrhlnk5pbw4wii6cfq" style="color: black;">2011 IEEE 52nd Annual Symposium on Foundations of Computer Science</a> </i> &nbsp;
vertex rt ∈ V if (1) it approximates all distances from rt to the other vertices up to a factor of α, and (2) its weight is at most β times the weight of the minimum spanning tree MST (G) of G.  ...  For a pair of parameters α, β ≥ 1, a spanning tree T of a weighted undirected n-vertex graph G = (V, E, w) is called an (α, β)-shallow-light tree (shortly, (α, β)-SLT) of G with respect to a designated  ...  INTRODUCTION Main Results A minimum spanning tree (henceforth, MST) of a weighted undirected graph G = (V, E, w), w : E → R + , is a spanning tree T = (V, H, w) of G with minimum weight w(T ) = e∈H w  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2011.18">doi:10.1109/focs.2011.18</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/focs/ElkinS11.html">dblp:conf/focs/ElkinS11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/klandpcpkrcxrlchv2dien57e4">fatcat:klandpcpkrcxrlchv2dien57e4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808040800/https://www.cs.bgu.ac.il/~shayso/Papers/FOCS11.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/c5/96c5557611d21241fa633125caf278cb4db1223c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2011.18"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

SPRIT: Identifying horizontal gene transfer in rooted phylogenetic trees

Tobias Hill, Karl JV Nordström, Mikael Thollesson, Tommy M Säfström, Andreas KE Vernersson, Robert Fredriksson, Helgi B Schiöth
<span title="">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/frh6t5i3jveazlshhan2ekhgcq" style="color: black;">BMC Evolutionary Biology</a> </i> &nbsp;
SPRIT presents both the minimum RSPR distance and the intermediate trees.  ...  One HGT can be represented by a rooted Subtree Prune and Regraft (RSPR) operation and the number of RSPRs separating two trees corresponds to the minimum number of HGT events.  ...  The columns for each program give the number of solved trees, the number of correctly solved trees and the average error in RSPRs, in that order. eight RSPRs and none of the tree pairs with ten RSPRs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2148-10-42">doi:10.1186/1471-2148-10-42</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/20152048">pmid:20152048</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC2829038/">pmcid:PMC2829038</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jiq5blcwqfbkzmtjw2wfjw4f44">fatcat:jiq5blcwqfbkzmtjw2wfjw4f44</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830081448/https://bmcevolbiol.biomedcentral.com/track/pdf/10.1186/1471-2148-10-42?site=http://bmcevolbiol.biomedcentral.com" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f0/40/f04004eaae92893428a405acb1dd13d2074276d4.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1186/1471-2148-10-42"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2829038" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 3,112 results