Handbook of mathematical functions with formulas, graphs, and mathematical tables, National Bureau of Standards Applied Mathematics Series. For sale by the Superintendent of Documents, U.S. Government Printing Office, vol.55, 1964. ,
On lipschitz embedding of finite metric spaces in Hilbert space, Israel Journal of Mathematics, vol.26, issue.1-2, pp.46-52, 1985. ,
DOI : 10.1007/BF02776078
The link between segregation and phylogenetic diversity, Journal of Mathematical Biology, vol.7, issue.2, pp.149-162, 2012. ,
DOI : 10.1007/s00285-011-0409-5
Hyperconvexity and tight-span theory for diversities Advances in Mathematics, pp.3172-3198, 2012. ,
Helly???s theorem and its relatives, Proc. Sympos. Pure Math, pp.101-180, 1963. ,
DOI : 10.1090/pspum/007/0157289
Geometry of cuts and metrics, volume 15 of Algorithms and Combinatorics, 1997. ,
Diversities, hyperconvexity and fixed points, Nonlinear Analysis: Theory, Methods & Applications, vol.95, pp.229-245, 2014. ,
DOI : 10.1016/j.na.2013.09.005
Conservation evaluation and phylogenetic diversity, Biological Conservation, vol.61, issue.1, pp.1-10, 1992. ,
DOI : 10.1016/0006-3207(92)91201-3
Cuts, Trees and ???1-Embeddings of Graphs*, COMBINATORICA, vol.24, issue.2, pp.233-269, 2004. ,
DOI : 10.1007/s00493-004-0015-x
Trees, tight-spans and point configurations, Discrete Mathematics, vol.312, issue.16, pp.2506-2521, 2012. ,
DOI : 10.1016/j.disc.2012.05.003
URL : http://dx.doi.org/10.1016/j.disc.2012.05.003
Packing Steiner trees, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.266-274, 2003. ,
Approximate min???max theorems for Steiner rooted-orientations of graphs and hypergraphs, Journal of Combinatorial Theory, Series B, vol.98, issue.6, pp.1233-1252, 2008. ,
DOI : 10.1016/j.jctb.2008.01.006
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem*, Combinatorica, vol.27, issue.1, pp.71-90, 2007. ,
DOI : 10.1007/s00493-007-0044-3
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.422-431, 1988. ,
DOI : 10.1109/SFCS.1988.21958
The geometry of graphs and some of its algorithmic applications, Combinatorica, vol.42, issue.115, pp.215-245, 1995. ,
DOI : 10.1007/BF01200757
Taxon Selection under Split Diversity, Systematic Biology, vol.58, issue.6, pp.586-594, 2009. ,
DOI : 10.1093/sysbio/syp058
URL : http://sysbio.oxfordjournals.org/cgi/content/short/58/6/586
Optimizing phylogenetic diversity under constraints, Journal of Theoretical Biology, vol.246, issue.1, pp.186-194, 2007. ,
DOI : 10.1016/j.jtbi.2006.12.021
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5019
On the Topological and Uniform Structure of Diversities, Journal of Function Spaces and Applications, vol.551, p.9, 2013. ,
DOI : 10.1007/BF02071981
Packing trees in communication networks, Journal of Combinatorial Optimization, vol.29, issue.2, pp.402-423, 2008. ,
DOI : 10.1007/s10878-008-9150-4
The Mean Width of a Convex Polytope, Journal of the London Mathematical Society, vol.1, issue.1, pp.207-209, 1968. ,
DOI : 10.1112/jlms/s1-43.1.207
Computing Phylogenetic Diversity for Split Systems, IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.5, issue.2, pp.235-244, 2008. ,
DOI : 10.1109/TCBB.2007.70260
Phylogenetic Diversity and the Greedy Algorithm, Systematic Biology, vol.54, issue.4, pp.527-529, 2005. ,
DOI : 10.1080/10635150590947023
Measure theory and integration, volume 76 of Graduate Studies in Mathematics, 2006. ,