An algorithm for computing virtual cut points in finite metric spaces

Andreas W. M. Dress; Katharina T. Huber; Jacobus 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, Jacobus Koolen, Vincent Moulton

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

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
Editors	Andreas Dress, Yinfeng Xu, Binhai Zhu
Publisher	Springer Berlin / Heidelberg
Pages	4-10
Number of pages	7
Volume	4616
DOIs	https://doi.org/10.1007/978-3-540-73556-4_3
Publication status	Published - 2007

Publication series

Name	Lecture Notes in Computing Science
Publisher	Springer Berlin / Heidelberg

Access to Document

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

Cite this

@inbook{08b3162044f24bcaae8a7d8937702391,

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 Jacobus Koolen and Vincent Moulton",

year = "2007",

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

language = "English",

volume = "4616",

series = "Lecture Notes in Computing Science",

publisher = "Springer Berlin / Heidelberg",

pages = "4--10",

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

booktitle = "Combinatorial Optimization and Applications",

}

An algorithm for computing virtual cut points in finite metric spaces. / Dress, Andreas W. M.; Huber, Katharina T.; Koolen, Jacobus et al.

Combinatorial Optimization and Applications. ed. / Andreas Dress; Yinfeng Xu; Binhai Zhu. Vol. 4616 Springer Berlin / Heidelberg, 2007. p. 4-10 (Lecture Notes in Computing Science).

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

TY - CHAP

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

AU - Dress, Andreas W. M.

AU - Huber, Katharina T.

AU - Koolen, Jacobus

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 - Chapter

VL - 4616

T3 - Lecture Notes in Computing Science

SP - 4

EP - 10

BT - Combinatorial Optimization and Applications

A2 - Dress, Andreas

A2 - Xu, Yinfeng

A2 - Zhu, Binhai

PB - Springer Berlin / Heidelberg

ER -