An algorithm for computing virtual cut points in finite metric spaces

Andreas W. M. Dress; Katharina T. Huber; Jack H. Koolen; Vincent Moulton

doi:10.1007/978-3-540-73556-4_3

An algorithm for computing virtual cut points in finite metric spaces

Andreas W. M. Dress, Katharina T. Huber, Jack H. Koolen, Vincent Moulton

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

7 Citations (Scopus)

Abstract

In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics.

Original language	English
Title of host publication	Combinatorial Optimization and Applications
Subtitle of host publication	First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
Editors	Andreas Dress, Yinfeng Xu, Binhai Zhu
Publisher	Springer
ISBN (Electronic)	978-3-540-73556-4
ISBN (Print)	978-3-540-73555-7
DOIs	https://doi.org/10.1007/978-3-540-73556-4_3
Publication status	Published - 2007

Publication series

Name	Lecture Notes in Computer Sciences
Publisher	Springer
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-540-73556-4_3

Cite this

Dress, A. W. M., Huber, K. T., Koolen, J. H., & Moulton, V. (2007). An algorithm for computing virtual cut points in finite metric spaces. In A. Dress, Y. Xu, & B. Zhu (Eds.), Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings (Lecture Notes in Computer Sciences). Springer. https://doi.org/10.1007/978-3-540-73556-4_3

Dress, Andreas W. M. ; Huber, Katharina T. ; Koolen, Jack H. ; Moulton, Vincent. / An algorithm for computing virtual cut points in finite metric spaces. Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings. editor / Andreas Dress ; Yinfeng Xu ; Binhai Zhu. Springer, 2007. (Lecture Notes in Computer Sciences).

@inproceedings{a1ce6b1dc50046e29787aac3c35c85d3,

title = "An algorithm for computing virtual cut points in finite metric spaces",

abstract = "In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics.",

author = "Dress, {Andreas W. M.} and Huber, {Katharina T.} and Koolen, {Jack H.} and Vincent Moulton",

year = "2007",

doi = "10.1007/978-3-540-73556-4_3",

language = "English",

isbn = "978-3-540-73555-7",

series = "Lecture Notes in Computer Sciences",

publisher = "Springer",

editor = "Andreas Dress and Yinfeng Xu and Binhai Zhu",

booktitle = "Combinatorial Optimization and Applications",

address = "Germany",

}

Dress, AWM, Huber, KT, Koolen, JH & Moulton, V 2007, An algorithm for computing virtual cut points in finite metric spaces. in A Dress, Y Xu & B Zhu (eds), Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings. Lecture Notes in Computer Sciences, Springer. https://doi.org/10.1007/978-3-540-73556-4_3

An algorithm for computing virtual cut points in finite metric spaces. / Dress, Andreas W. M.; Huber, Katharina T.; Koolen, Jack H.; Moulton, Vincent.

Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings. ed. / Andreas Dress; Yinfeng Xu; Binhai Zhu. Springer, 2007. (Lecture Notes in Computer Sciences).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An algorithm for computing virtual cut points in finite metric spaces

AU - Dress, Andreas W. M.

AU - Huber, Katharina T.

AU - Koolen, Jack H.

AU - Moulton, Vincent

PY - 2007

Y1 - 2007

N2 - In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics.

AB - In this note, we consider algorithms for computing virtual cut points in finite metric spaces and explain how these points can be used to study compatible decompositions of metrics generalizing the well-known decomposition of a tree metric into a sum of pairwise compatible split metrics.

U2 - 10.1007/978-3-540-73556-4_3

DO - 10.1007/978-3-540-73556-4_3

M3 - Conference contribution

SN - 978-3-540-73555-7

T3 - Lecture Notes in Computer Sciences

BT - Combinatorial Optimization and Applications

A2 - Dress, Andreas

A2 - Xu, Yinfeng

A2 - Zhu, Binhai

PB - Springer

ER -

Dress AWM, Huber KT, Koolen JH, Moulton V. An algorithm for computing virtual cut points in finite metric spaces. In Dress A, Xu Y, Zhu B, editors, Combinatorial Optimization and Applications: First International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings. Springer. 2007. (Lecture Notes in Computer Sciences). https://doi.org/10.1007/978-3-540-73556-4_3