{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T11:53:33Z","timestamp":1764330813590},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_11","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:13:22Z","timestamp":1285632802000},"page":"123-133","source":"Crossref","is-referenced-by-count":3,"title":["Approximating the Best-Fit Tree Under L p Norms"],"prefix":"10.1007","author":[{"given":"Boulos","family":"Harb","sequence":"first","affiliation":[]},{"given":"Sampath","family":"Kannan","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"McGregor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1137\/S0097539795296334","volume":"28","author":"R. Agarwala","year":"1999","unstructured":"Agarwala, R., Bafna, V., Farach, M., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics. SIAM J. Comput.\u00a028, 1073\u20131085 (1999)","journal-title":"SIAM J. Comput."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1009837726913","volume":"3","author":"B. Ma","year":"1999","unstructured":"Ma, B., Wang, L., Zhang, L.: Fitting distances by tree metrics with increment error. J. Comb. Optim.\u00a03, 213\u2013225 (1999)","journal-title":"J. Comb. Optim."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1145\/320211.320212","volume":"46","author":"M. Farach","year":"1999","unstructured":"Farach, M., Kannan, S.: Efficient algorithms for inverting evolution. Journal of the ACM\u00a046, 437\u2013450 (1999)","journal-title":"Journal of the ACM"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/S0097539798342496","volume":"31","author":"M. Cryan","year":"2001","unstructured":"Cryan, M., Goldberg, L., Goldberg, P.: Evolutionary trees can be learned in polynomial time in the two state general markov model. SIAM J. Comput.\u00a031, 375\u2013397 (2001)","journal-title":"SIAM J. Comput."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0022-5193(77)90351-4","volume":"64","author":"M. Waterman","year":"1977","unstructured":"Waterman, M., Smith, T., Singh, M., Beyer, W.: Additive evolutionary trees. J. Theoretical Biology\u00a064, 199\u2013213 (1977)","journal-title":"J. Theoretical Biology"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF02458863","volume":"49","author":"W. Day","year":"1987","unstructured":"Day, W.: Computational complexity of inferring phylogenies from dissimilarity matrices. Bulletin of Mathematical Biology\u00a049, 461\u2013467 (1987)","journal-title":"Bulletin of Mathematical Biology"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01188585","volume":"13","author":"M. Farach","year":"1995","unstructured":"Farach, M., Kannan, S., Warnow, T.: A robust model for finding optimal evolutionary trees. Algorithmica\u00a013, 155\u2013179 (1995)","journal-title":"Algorithmica"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-39658-1_21","volume-title":"Algorithms - ESA 2003","author":"D. Emanuel","year":"2003","unstructured":"Emanuel, D., Fiat, A.: Correlation clustering - minimizing disagreements on arbitrary weighted graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 208\u2013220. Springer, Heidelberg (2003)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"E.D. Demaine","year":"2003","unstructured":"Demaine, E.D., Immorlica, N.: Correlation clustering with partial information. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 1\u201313. Springer, Heidelberg (2003)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. In: Proc. of the 43rd IEEE Annual Symposium on Foundations of Computer Science, p. 238 (2002)","DOI":"10.1109\/SFCS.2002.1181947"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. In: Proc. of the 44th IEEE Annual Symposium on Foundations of Computer Science, p. 524 (2003)","DOI":"10.1109\/SFCS.2003.1238225"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-27821-4_9","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Dhamdhere","year":"2004","unstructured":"Dhamdhere, K.: Approximating additive distortion of embeddings into line metrics. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 96\u2013104. Springer, Heidelberg (2004)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-24749-4_21","volume-title":"STACS 2004","author":"K. Dhamdhere","year":"2004","unstructured":"Dhamdhere, K., Gupta, A., Ravi, R.: Approximation algorithms for minimizing average distortion. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 234\u2013245. Springer, Heidelberg (2004)"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S0097539793243016","volume":"25","author":"N. Garg","year":"1996","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput.\u00a025, 235\u2013251 (1996)","journal-title":"SIAM J. Comput."},{"key":"11_CR15","unstructured":"Ailon, N., Charikar, M.: Personal comunication (2005)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538462_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T02:54:21Z","timestamp":1619492061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11538462_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}